587 search results - page 83 / 118 » Clustering Improves the Exploration of Graph Mining Results |
100
click to vote
CIE
2007
Springer
15 years 6 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
113
click to vote
KDD
2005
ACM
16 years 9 days ago
2005
ACM
Machine learning and data mining can be effectively used to model, classify and discover interesting information for a wide variety of data including email. The Email Mining Toolk...
DCOSS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We present a distributed, localized and integrated approach for establishing both low-level (i.e. exploration of 1-hop neighbors, interference avoidance) and high-level (...
EGPGV
2004
Springer
15 years 5 months ago
2004
Springer
This paper presents a new interactive parallel method for direct visualization of large particle datasets. Based on a parallel rendering cluster, a frame rate of 9 frames-per-seco...
100
click to vote
KDD
2009
ACM
16 years 13 days ago
2009
ACM
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...