247 search results - page 3 / 50 » On Finding Large Conjunctive Clusters |
EDBT
2012
ACM
11 years 10 months ago
2012
ACM
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
ICS
2010
Tsinghua U.
14 years 4 months ago
2010
Tsinghua U.
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
SIGMOD
2000
ACM
13 years 12 months ago
2000
ACM
High dimensional data has always been a challenge for clustering algorithms because of the inherent sparsity of the points. Recent research results indicate that in high dimension...
IDEAL
2004
Springer
14 years 27 days ago
2004
Springer
Abstract. Earlier research has resulted in the production of an ‘allrules’ algorithm for data-mining that produces all conjunctive rules of above given confidence and coverage...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Data mining is the task of discovering interesting patterns from large amounts of data. There are many data mining tasks, such as classification, clustering, association rule mini...