7150 search results - page 428 / 1430 » Graph-Based Data Mining |
143
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
We present a novel algorithm called Clicks, that finds clusters in categorical datasets based on a search for k-partite maximal cliques. Unlike previous methods, Clicks mines subs...
171
click to vote
ICDM
2005
IEEE
16 years 11 days ago
2005
IEEE
In this paper we study when the disclosure of data mining results represents, per se, a threat to the anonymity of the individuals recorded in the analyzed database. The novelty o...
172
click to vote
PAKDD
2005
ACM
16 years 7 days ago
2005
ACM
We study the problem of mining frequent value sets from a large sensor network. We discuss how sensor stream data could be represented that facilitates efficient online mining and ...
149
click to vote
DAWAK
2000
Springer
15 years 11 months ago
2000
Springer
In data mining, searching for frequent patterns is a common basic operation. It forms the basis of many interesting decision support processes. In this paper we present a new type ...
183
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Abstract—Set intersection is the core in a variety of problems, e.g. frequent itemset mining and sparse boolean matrix multiplication. It is well-known that large speed gains can...