Sciweavers

7 search results - page 1 / 2
» gApprox: Mining Frequent Approximate Patterns from a Massive...
Sort
View
ICDM
2007
IEEE
175views Data Mining» more  ICDM 2007»
13 years 11 months ago
gApprox: Mining Frequent Approximate Patterns from a Massive Network
Recently, there arise a large number of graphs with massive sizes and complex structures in many new applications, such as biological networks, social networks, and the Web, deman...
Chen Chen, Xifeng Yan, Feida Zhu, Jiawei Han
KDD
2005
ACM
162views Data Mining» more  KDD 2005»
14 years 5 months ago
Discovering frequent topological structures from graph datasets
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...
Ruoming Jin, Chao Wang, Dmitrii Polshakov, Sriniva...
KDD
2002
ACM
182views Data Mining» more  KDD 2002»
14 years 5 months ago
ANF: a fast and scalable tool for data mining in massive graphs
Graphs are an increasingly important data source, with such important graphs as the Internet and the Web. Other familiar graphs include CAD circuits, phone records, gene sequences...
Christopher R. Palmer, Phillip B. Gibbons, Christo...
KDD
2005
ACM
127views Data Mining» more  KDD 2005»
13 years 10 months ago
Mining closed relational graphs with connectivity constraints
Relational graphs are widely used in modeling large scale networks such as biological networks and social networks. In this kind of graph, connectivity becomes critical in identif...
Xifeng Yan, Xianghong Jasmine Zhou, Jiawei Han
SDM
2011
SIAM
223views Data Mining» more  SDM 2011»
12 years 7 months ago
Characterizing Uncertain Data using Compression
Motivated by sensor networks, mobility data, biology and life sciences, the area of mining uncertain data has recently received a great deal of attention. While various papers hav...
Francesco Bonchi, Matthijs van Leeuwen, Antti Ukko...