Sciweavers

243 search results - page 18 / 49
» Scalable mining of large disk-based graph databases
Sort
View
SDM
2009
SIAM
144views Data Mining» more  SDM 2009»
14 years 4 months ago
CORE: Nonparametric Clustering of Large Numeric Databases.
Current clustering techniques are able to identify arbitrarily shaped clusters in the presence of noise, but depend on carefully chosen model parameters. The choice of model param...
Andrej Taliun, Arturas Mazeika, Michael H. Bö...
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
14 years 8 months ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos
CIKM
2009
Springer
14 years 2 months ago
A query language for analyzing networks
With more and more large networks becoming available, mining and querying such networks are increasingly important tasks which are not being supported by database models and query...
Anton Dries, Siegfried Nijssen, Luc De Raedt
ICDM
2006
IEEE
132views Data Mining» more  ICDM 2006»
14 years 1 months ago
Mining for Tree-Query Associations in a Graph
New applications of data mining, such as in biology, bioinformatics, or sociology, are faced with large datasets structured as graphs. We present an efficient algorithm for minin...
Eveline Hoekx, Jan Van den Bussche
SSDBM
2010
IEEE
185views Database» more  SSDBM 2010»
13 years 6 months ago
DESSIN: Mining Dense Subgraph Patterns in a Single Graph
Currently, a large amount of data can be best represented as graphs, e.g., social networks, protein interaction networks, etc. The analysis of these networks is an urgent research ...
Shirong Li, Shijie Zhang, Jiong Yang