Sciweavers

243 search results - page 8 / 49
» Scalable mining of large disk-based graph databases
Sort
View
KDD
2003
ACM
122views Data Mining» more  KDD 2003»
14 years 8 months ago
Natural communities in large linked networks
We are interested in finding natural communities in largescale linked networks. Our ultimate goal is to track changes over time in such communities. For such temporal tracking, we...
John E. Hopcroft, Omar Khan, Brian Kulis, Bart Sel...
ICDM
2009
IEEE
137views Data Mining» more  ICDM 2009»
14 years 2 months ago
A Local Scalable Distributed Expectation Maximization Algorithm for Large Peer-to-Peer Networks
This paper offers a local distributed algorithm for expectation maximization in large peer-to-peer environments. The algorithm can be used for a variety of well-known data mining...
Kanishka Bhaduri, Ashok N. Srivastava
SDM
2009
SIAM
138views Data Mining» more  SDM 2009»
14 years 4 months ago
ShatterPlots: Fast Tools for Mining Large Graphs.
Graphs appear in several settings, like social networks, recommendation systems, computer communication networks, gene/protein biological networks, among others. A deep, recurring...
Ana Paula Appel, Andrew Tomkins, Christos Faloutso...
ICDE
2012
IEEE
227views Database» more  ICDE 2012»
11 years 10 months ago
Horizontal Reduction: Instance-Level Dimensionality Reduction for Similarity Search in Large Document Databases
—Dimensionality reduction is essential in text mining since the dimensionality of text documents could easily reach several tens of thousands. Most recent efforts on dimensionali...
Min-Soo Kim 0001, Kyu-Young Whang, Yang-Sae Moon
SIGMOD
2009
ACM
192views Database» more  SIGMOD 2009»
14 years 7 months ago
Scalable join processing on very large RDF graphs
With the proliferation of the RDF data format, engines for RDF query processing are faced with very large graphs that contain hundreds of millions of RDF triples. This paper addre...
Thomas Neumann, Gerhard Weikum