Sciweavers

128 search results - page 1 / 26
» Towards proximity pattern mining in large graphs
Sort
View
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
13 years 9 months ago
Towards proximity pattern mining in large graphs
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
Arijit Khan, Xifeng Yan, Kun-Lung Wu
DEXAW
2009
IEEE
131views Database» more  DEXAW 2009»
13 years 11 months ago
Clustering of Short Strings in Large Databases
—A novel method CLOSS intended for textual databases is proposed. It successfully identifies misspelled string clusters, even if the cluster border is not prominent. The method ...
Michail Kazimianec, Arturas Mazeika
ICDM
2008
IEEE
222views Data Mining» more  ICDM 2008»
13 years 11 months ago
GRAPHITE: A Visual Query System for Large Graphs
We present Graphite, a system that allows the user to visually construct a query pattern, finds both its exact and approximate matching subgraphs in large attributed graphs, and ...
Duen Horng Chau, Christos Faloutsos, Hanghang Tong...
KDD
2006
ACM
122views Data Mining» more  KDD 2006»
14 years 4 months ago
Measuring and extracting proximity in networks
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...
Yehuda Koren, Stephen C. North, Chris Volinsky
KDD
2008
ACM
243views Data Mining» more  KDD 2008»
14 years 4 months ago
Permu-pattern: discovery of mutable permutation patterns with proximity constraint
Pattern discovery in sequences is an important problem in many applications, especially in computational biology and text mining. However, due to the noisy nature of data, the tra...
Meng Hu, Jiong Yang, Wei Su