587 search results - page 1 / 118 » Clustering Improves the Exploration of Graph Mining Results |
IFIP12
2007
13 years 6 months ago
2007
Mining frequent subgraphs is an area of research where we have a given set of graphs, and where we search for (connected) subgraphs contained in many of these graphs. Each graph ca...
SDM
2009
SIAM
14 years 1 months ago
2009
SIAM
Process Mining refers to the extraction of process models from event logs. Real-life processes tend to be less structured and more flexible. Traditional process mining algorithms...
PAKDD
2007
ACM
13 years 10 months ago
2007
ACM
In this paper, we investigate and utilize the characteristic of the group movement of objects to achieve energy conservation in the inherently resource-constrained wireless object ...
KDD
2009
ACM
14 years 5 months ago
2009
ACM
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...
KDD
2004
ACM
14 years 5 months ago
2004
ACM
d Abstract] Christian Borgs Jennifer Chayes Mohammad Mahdian Amin Saberi We propose to use the community structure of Usenet for organizing and retrieving the information stored i...