87 search results - page 7 / 18 » ShatterPlots: Fast Tools for Mining Large Graphs. |
192
click to vote
SDM
2011
SIAM
14 years 13 days ago
2011
SIAM
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...
94
Voted
KDD
2005
ACM
15 years 10 months ago
2005
ACM
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
103
click to vote
SDM
2008
SIAM
14 years 11 months ago
2008
SIAM
Given an author-conference network that evolves over time, which are the conferences that a given author is most closely related with, and how do they change over time? Large time...
ATVA
2006
Springer
15 years 1 months ago
2006
Springer
We address the problem of model checking hybrid systems which exhibit nontrivial discrete behavior and thus cannot be treated by considering the discrete states one by one, as most...
KDD
1994
ACM
15 years 1 months ago
1994
ACM
Oneof the mainobstacles in applying data mining techniques to large, real-world databasesis the lack of efficient data management.In this paper, wepresent the design and implement...