Search

Your search keyword '"Fan, Wenfei"' showing total 761 results
Start Over Author "Fan, Wenfei"

Refine your results

more »

more »

more »

more »
761 results on '"Fan, Wenfei"'

3. Fishing Fort: A System for Graph Analytics with ML Prediction and Logic Deduction

Author

Wenfei Fan and Shuhao Liu, Fan, Wenfei, Liu, Shuhao, Wenfei Fan and Shuhao Liu, Fan, Wenfei, and Liu, Shuhao

Abstract

This paper reports Fishing Fort, a graph analytic system developed in response to the following questions. What practical value can we get out of graph analytics? How can we effectively deduce the value from a real-life graph? Where can we get clean graphs to make accurate analyses possible? To answer these questions, Fishing Fort advocates to unify logic deduction and ML prediction by proposing Graph Association Rules (GARs), a class of logic rules in which ML models can be embedded as predicates. It employs GARs to deduce graph associations, enrich graphs and clean graphs. It has been deployed in production lines and proven effective in online recommendation, drug discovery, credit risk assessment, battery manufacturing and cybersecurity, among other things.

Published
2024
Full Text
View/download PDF

10. Think Sequential, Run Parallel

Author

Fan, Wenfei, Liu, Muyang, Xu, Ruiqi, Hou, Lei, Li, Dongze, Meng, Zizhong, Hutchison, David, Series Editor, Kanade, Takeo, Series Editor, Kittler, Josef, Series Editor, Kleinberg, Jon M., Series Editor, Mattern, Friedemann, Series Editor, Mitchell, John C., Series Editor, Naor, Moni, Series Editor, Pandu Rangan, C., Series Editor, Steffen, Bernhard, Series Editor, Terzopoulos, Demetri, Series Editor, Tygar, Doug, Series Editor, Weikum, Gerhard, Series Editor, Jones, Cliff, editor, Wang, Ji, editor, and Zhan, Naijun, editor

Published
2018
Full Text
View/download PDF

11. Performance Guarantees for Distributed Reachability Queries

Author

Fan, Wenfei, Wang, Xin, and Wu, Yinghui

Subjects
Computer Science - Databases
Abstract

In the real world a graph is often fragmented and distributed across different sites. This highlights the need for evaluating queries on distributed graphs. This paper proposes distributed evaluation algorithms for three classes of queries: reachability for determining whether one node can reach another, bounded reachability for deciding whether there exists a path of a bounded length between a pair of nodes, and regular reachability for checking whether there exists a path connecting two nodes such that the node labels on the path form a string in a given regular expression. We develop these algorithms based on partial evaluation, to explore parallel computation. When evaluating a query Q on a distributed graph G, we show that these algorithms possess the following performance guarantees, no matter how G is fragmented and distributed: (1) each site is visited only once; (2) the total network traffic is determined by the size of Q and the fragmentation of G, independent of the size of G; and (3) the response time is decided by the largest fragment of G rather than the entire G. In addition, we show that these algorithms can be readily implemented in the MapReduce framework. Using synthetic and real-life data, we experimentally verify that these algorithms are scalable on large graphs, regardless of how the graphs are distributed., Comment: VLDB2012

Published
2012

12. Capturing Topology in Graph Pattern Matching

Author

Ma, Shuai, Cao, Yang, Fan, Wenfei, Huai, Jinpeng, and Wo, Tianyu

Subjects
Computer Science - Databases
Abstract

Graph pattern matching is often defined in terms of subgraph isomorphism, an NP-complete problem. To lower its complexity, various extensions of graph simulation have been considered instead. These extensions allow pattern matching to be conducted in cubic-time. However, they fall short of capturing the topology of data graphs, i.e., graphs may have a structure drastically different from pattern graphs they match, and the matches found are often too large to understand and analyze. To rectify these problems, this paper proposes a notion of strong simulation, a revision of graph simulation, for graph pattern matching. (1) We identify a set of criteria for preserving the topology of graphs matched. We show that strong simulation preserves the topology of data graphs and finds a bounded number of matches. (2) We show that strong simulation retains the same complexity as earlier extensions of simulation, by providing a cubic-time algorithm for computing strong simulation. (3) We present the locality property of strong simulation, which allows us to effectively conduct pattern matching on distributed graphs. (4) We experimentally verify the effectiveness and efficiency of these algorithms, using real-life data and synthetic data., Comment: VLDB2012

Published
2011

17. Data Quality Problems beyond Consistency and Deduplication

Author

Fan, Wenfei, Geerts, Floris, Ma, Shuai, Tang, Nan, Yu, Wenyuan, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Tannen, Val, editor, Wong, Limsoon, editor, Libkin, Leonid, editor, Fan, Wenfei, editor, Tan, Wang-Chiew, editor, and Fourman, Michael, editor

Published
2013
Full Text
View/download PDF

18. Virtual Network Mapping: A Graph Pattern Matching Approach

Author

Cao, Yang, Fan, Wenfei, Ma, Shuai, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, and Maneth, Sebastian, editor

Published
2015
Full Text
View/download PDF

30. Transaction Scheduling: From Conflicts to Runtime Conflicts

Author

Cao, Yang, Fan, Wenfei, Ou, Weijie, Xie, Rui, and Zhao, Wenyue

Subjects
concurrency control, transaction scheduling, transaction processing
Abstract

This paper studies how to improve the performance of main memory multicore OLTP systems for executing transactions with conflicts. A promising approach is to partition transaction workloads into mutually conflict-free clusters, and distribute the clusters to different cores for concurrent execution. We show that if transactions in each cluster are properly scheduled, transactions that are traditionally considered conflicting can be executed without conflicts at runtime. In light of this, we propose to schedule transactions and reduce runtime conflicts, instead of partitioning based on the conventional notion of conflicts. We formulate the transaction scheduling problem to minimize runtime conflicts, and show that the problem is NP-complete. This said, we develop an effcient scheduling algorithm to improve parallelism. Moreover, for transactions that are not packed in batches, we show that runtime conflict analysis also helps reduce conflict penalties, by proposing a proactive deferring method. Using standard and enhanced benchmarks, we show that on average our scheduling and proactive deferring methods improve the throughput of existing partitioners and concurrency control protocols by 131% and 109%, respectively, up to 294% and 152%.

Published
2023

31. Detecting Errors in Numeric Attributes

Author

Fan, Grace, Fan, Wenfei, Geerts, Floris, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Kobsa, Alfred, editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Weikum, Gerhard, editor, Li, Feifei, editor, Li, Guoliang, editor, Hwang, Seung-won, editor, Yao, Bin, editor, and Zhang, Zhenjie, editor

Published
2014
Full Text
View/download PDF

32. Reasoning about record matching rules

Author

Fan, Wenfei, Jia, Xibei, Li, Jianzhong, and Ma, Shuai

Abstract

To accurately match records it is often necessary to utilize the semantics of the data. Functional dependencies (FDs) have proven useful in identifying tuples in a clean relation, based on the semantics of the data. For all the reasons that FDs and their inference are needed, it is also important to develop dependencies and their reasoning techniques for matching tuples from unreliabledata sources. This paper investigates dependencies and their reasoning for record matching. (a) We introduce a class of matching dependencies(MDs) for specifying the semantics of data in unreliable relations, defined in terms of similarity metricsand a dynamic semantics. (b) We identify a special case of MDs, referred to as relative candidate keys(RCKs), to determine what attributes to compare and how to compare them when matching records across possibly different relations. (c) We propose a mechanism for inferring MDs, a departure from traditional implication analysis, such that when we cannot match records by comparing attributes that contain errors, we may still find matches by using other, more reliable attributes. (d) We provide an O(n2) time algorithm for inferring MDs, and an effective algorithm for deducing a set of RCKs from MDs. (e) We experimentally verify that the algorithms help matching tools efficiently identify keys at compile time for matching, blocking or windowing, and that the techniques effectively improve both the quality and efficiency of various record matching methods.

Published
2024
Full Text
View/download PDF

33. Semandaq

Author

Fan, Wenfei, Geerts, Floris, and Jia, Xibei

Abstract

We present Semandaq, a prototype system for improving the quality of relational data. Based on the recently proposed conditional functional dependencies(CFDs), it detects and repairs errors and inconsistencies that emerge as violations of these constraints. We demonstrate the following functionalities supported by Semandaq: (a) an interface for specifying CFDs; (b) a visual tool for automated detection of CFD violations in relational data, leveraging efficient SQL-based techniques; (c) extensive visual data exploration capabilities that provide the user with various measures of the quality of the data; (d) repair (cleaning) functionality without excess human interaction, built upon CFD-based cleaning algorithms; we show how Semandaq allows for a natural exploration of the quality of the obtained repairs. Semandaq is a promising tool that provides easy access and user-friendly data quality facilities for any relational database system.

Published
2024
Full Text
View/download PDF

34. Propagating functional dependencies with conditions

Author

Fan, Wenfei, Ma, Shuai, Hu, Yanli, Liu, Jie, and Wu, Yinghui

Abstract

The dependency propagation problem is to determine, given a view defined on data sources and a set of dependencies on the sources, whether another dependency is guaranteed to hold on the view. This paper investigates dependency propagation for recently proposed conditional functional dependencies (CFDs). The need for this study is evident in data integration, exchange and cleaning since dependencies on data sources often only hold conditionallyon the view. We investigate dependency propagation for views defined in various fragments of relational algebra, CFDs as view dependencies, and for source dependencies given as either CFDs or traditional functional dependencies (FDs). (a) We establish lower and upper bounds, all matching, ranging from PTIME to undecidable. These not only provide the firstresults for CFD propagation, but also extend the classical work of FD propagation by giving new complexity bounds in the presence of finite domains. (b) We provide the first algorithm for computing a minimal cover of allCFDs propagated via SPC views; the algorithm has the same complexity as one of the most efficient algorithms for computing a cover of FDs propagated via a projection view, despite the increased expressive power of CFDs and SPC views. (c) We experimentally verify that the algorithm is efficient.

Published
2024
Full Text
View/download PDF

38. Querying Big Social Data

Author

Fan, Wenfei, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Gottlob, Georg, editor, Grasso, Giovanni, editor, Olteanu, Dan, editor, and Schallhart, Christian, editor

Published
2013
Full Text
View/download PDF

39. Data Quality: Theory and Practice

Author

Fan, Wenfei, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Gao, Hong, editor, Lim, Lipyeow, editor, Wang, Wei, editor, Li, Chuan, editor, and Chen, Lei, editor

Published
2012
Full Text
View/download PDF

44. Analyses and Validation of Conditional Dependencies with Built-in Predicates

Author

Chen, Wenguang, Fan, Wenfei, Ma, Shuai, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Bhowmick, Sourav S., editor, Küng, Josef, editor, and Wagner, Roland, editor

Published
2009
Full Text
View/download PDF

45. Conditional Dependencies: A Principled Approach to Improving Data Quality

Author

Fan, Wenfei, Geerts, Floris, Jia, Xibei, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, and Sexton, Alan P., editor

Published
2009
Full Text
View/download PDF

48. Extending Online Travel Agency with Adaptive Reservations

Author

Zhang, Yu, Fan, Wenfei, Chen, Huajun, Sheng, Hao, Wu, Zhaohui, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Meersman, Robert, editor, and Tari, Zahir, editor

Published
2007
Full Text
View/download PDF

49. XML Publishing: Bridging Theory and Practice

Author

Fan, Wenfei, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Arenas, Marcelo, editor, and Schwartzbach, Michael I., editor

Published
2007
Full Text
View/download PDF

50. Selectively Storing XML Data in Relations

Author

Fan, Wenfei, Ma, Lisha, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Bressan, Stéphane, editor, Küng, Josef, editor, and Wagner, Roland, editor

Published
2006
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results