• Publications
  • Influence
Comparing Stars: On Approximating Graph Edit Distance
TLDR
In this paper we introduce three novel methods to compute the upper and lower bounds for the edit distance between two graphs in polynomial time. Expand
  • 313
  • 53
  • PDF
Ranking Outliers Using Symmetric Neighborhood Relationship
TLDR
Mining outliers in database is to find exceptional objects that deviate from the rest of the data set. Expand
  • 355
  • 43
  • PDF
Finding k-dominant skylines in high dimensional space
TLDR
We propose a new concept, called k-dominant skyline, to find more important and meaningful skyline points in high dimensional space, which relaxes the idea of dominance to k. Expand
  • 424
  • 40
  • PDF
Similarity evaluation on tree-structured data
TLDR
We propose to transform tree-structured data into an approximate numerical multidimensional vector which encodes the original structure information. Expand
  • 165
  • 22
  • PDF
On High Dimensional Skylines
TLDR
We introduce a novel metric, called skyline frequency, to compare and rank the interestingness of data points based on how often they are returned in the skyline when different subsets of dimensions (i.e., subspaces) are considered. Expand
  • 261
  • 21
  • PDF
Carpenter: finding closed patterns in long biological datasets
TLDR
We describe a new algorithm called CARPENTER that is specially designed to handle bioinformatics datasets having a large number of attributes and relatively small number of rows. Expand
  • 259
  • 18
  • PDF
Mining top-K covering rule groups for gene expression data
TLDR
In this paper, we propose a novel algorithm to discover the top-k covering rule groups for each row of gene expression profiles. Expand
  • 145
  • 18
  • PDF
An Efficient Graph Indexing Method
TLDR
We propose SEGOS, an efficient indexing and query processing framework for graph similarity search based on sub-unit decomposition of graphs. Expand
  • 74
  • 18
  • PDF
Efficient Mining of Intertransaction Association Rules
TLDR
We introduce the notion of Intertransaction association rule and develop an efficient algorithm, FITI (first intra then inter), for mining intertransaction associations, which adopts two major ideas: 1) an intertransACTION frequent itemset contains only the frequent itemsets of its corresponding intratransaction counterpart. Expand
  • 180
  • 16
  • PDF
...
1
2
3
4
5
...