Xifeng Yan

Suggest Changes
Jiawei Han174
Philip S. Yu82
Rakesh Agrawal62
George Karypis57
Christos Faloutsos52
152Jiawei Han
100Philip S. Yu
55Hong Cheng
48Jeffrey Xu Yu
46Haixun Wang

Filter Results:

  • Full text PDF available (161)

Publication Year

2002
2017
  • This year (6)
  • Last 5 years (89)
  • Last 10 years (144)

Publication Type

Co-author

Journals and Conferences

Data Set Used

Key Phrases

Method

Organism

Learn More
gSpan: Graph-Based Substructure Pattern Mining
We investigate new approaches for frequent graph-based pattern mining in graph datasets and propose a novel algorithm called gSpan (graph-based Substructure pattern mining), which discovers frequent substructures without candidate generation. gSpan builds a new lexicographic order among graphs, and maps each graph to a unique minimum DFS code as its… (More)
PathSim: Meta Path-Based Top-K Similarity Search in Heterogeneous Information Networks
Similarity search is a primitive operation in database and Web search engines. With the advent of large-scale heterogeneous information networks that consist of multi-typed, interconnected objects, such as the bibliographic networks and social media networks, it is important to study similarity search in such networks. Intuitively, two objects are similar… (More)
Mining Frequent Patterns in Data Streams at Multiple Time Granularities
Although frequent-pattern mining has been widely studied and used, it is challenging to extend it to data streams. Compared with mining a static transaction data set, the streaming case has far more information to track and far greater complexity to manage. Infrequent items can become frequent later on and hence cannot be ignored. The storage structure need… (More)
Frequent pattern mining: current status and future directions
Frequent pattern mining has been a focused theme in data mining research for over a decade. Abundant literature has been dedicated to this research and tremendous progress has been made, ranging from efficient and scalable algorithms for frequent itemset mining in transaction databases to numerous research frontiers, such as sequential pattern mining,… (More)
Statistical Debugging: A Hypothesis Testing-Based Approach
Manual debugging is tedious, as well as costly. The high cost has motivated the development of fault localization techniques, which help developers search for fault locations. In this paper, we propose a new statistical method, called SOBER, which automatically localizes software faults without any prior knowledge of the program semantics. Unlike existing… (More)
Graph Indexing: A Frequent Structure-based Approach
Graph has become increasingly important in modelling complicated structures and schemaless data such as proteins, chemical compounds, and XML documents. Given a <i>graph query</i>, it is desirable to retrieve graphs quickly from a large database via <i>graph-based indices.</i> In this paper, we investigate the issues of indexing graphs and propose a novel… (More)
SOBER: statistical model-based bug localization
Automated localization of software bugs is one of the essential issues in debugging aids. Previous studies indicated that the evaluation history of program predicates may disclose important clues about underlying bugs. In this paper, we propose a new statistical model-based approach, called SOBER, which localizes software bugs without any prior knowledge of… (More)
Synthesizing Near-Optimal Malware Specifications from Suspicious Behaviors
Fueled by an emerging underground economy, malware authors are exploiting vulnerabilities at an alarming rate. To make matters worse, obfuscation tools are commonly available, and much of the malware is open source, leading to a huge number of variants. Behavior-based detection techniques are a promising solution to this growing problem. However, these… (More)