Sciweavers

292 search results - page 32 / 59
» A Partition-Based Approach to Graph Mining
Sort
View
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
12 years 11 months ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon
PVLDB
2010
112views more  PVLDB 2010»
13 years 6 months ago
On Triangulation-based Dense Neighborhood Graphs Discovery
This paper introduces a new definition of dense subgraph pattern, the DN-graph. DN-graph considers both the size of the sub-structure and the minimum level of interactions betwee...
Nan Wang, Jingbo Zhang, Kian-Lee Tan, Anthony K. H...
ICDM
2006
IEEE
176views Data Mining» more  ICDM 2006»
14 years 2 months ago
Razor: mining distance-constrained embedded subtrees
Due to their capability for expressing semantics and relationships among data objects, semi-structured documents have become a common way of representing domain knowledge. Compari...
Henry Tan, Tharam S. Dillon, Fedja Hadzic, Elizabe...
CIKM
2006
Springer
14 years 5 days ago
TRIPS and TIDES: new algorithms for tree mining
Recent research in data mining has progressed from mining frequent itemsets to more general and structured patterns like trees and graphs. In this paper, we address the problem of...
Shirish Tatikonda, Srinivasan Parthasarathy, Tahsi...
SDM
2007
SIAM
104views Data Mining» more  SDM 2007»
13 years 10 months ago
Fast Multilevel Transduction on Graphs
The recent years have witnessed a surge of interest in graphbased semi-supervised learning methods. The common denominator of these methods is that the data are represented by the...
Fei Wang, Changshui Zhang