Sciweavers

2227 search results - page 12 / 446
» Graph Mining based on a Data Partitioning Approach
Sort
View
KDD
2004
ACM
145views Data Mining» more  KDD 2004»
15 years 5 months ago
A graph-theoretic approach to extract storylines from search results
We present a graph-theoretic approach to discover storylines from search results. Storylines are windows that offer glimpses into interesting themes latent among the top search re...
Ravi Kumar, Uma Mahadevan, D. Sivakumar
KDD
2009
ACM
182views Data Mining» more  KDD 2009»
16 years 28 days ago
Scalable graph clustering using stochastic flows: applications to community discovery
Algorithms based on simulating stochastic flows are a simple and natural solution for the problem of clustering graphs, but their widespread use has been hampered by their lack of...
Venu Satuluri, Srinivasan Parthasarathy
ILP
2003
Springer
15 years 5 months ago
Mining Model Trees: A Multi-relational Approach
In many data mining tools that support regression tasks, training data are stored in a single table containing both the target field (dependent variable) and the attributes (indepe...
Annalisa Appice, Michelangelo Ceci, Donato Malerba
FLAIRS
2010
15 years 2 months ago
Using a Graph-Based Approach for Discovering Cybercrime
The ability to mine data represented as a graph has become important in several domains for detecting various structural patterns. One important area of data mining is anomaly det...
William Eberle, Lawrence B. Holder, Jeffrey Graves
ICML
2007
IEEE
16 years 1 months ago
Entire regularization paths for graph data
Graph data such as chemical compounds and XML documents are getting more common in many application domains. A main difficulty of graph data processing lies in the intrinsic high ...
Koji Tsuda