4085 search results - page 261 / 817 » Benchmarking Data Mining Algorithms |
122
Voted
KDD
2002
ACM
16 years 4 months ago
2002
ACM
We present a framework for mining association rules from transactions consisting of categorical items where the data has been randomized to preserve privacy of individual transact...
118
click to vote
IFSA
2007
Springer
15 years 10 months ago
2007
Springer
Tree mining consists in discovering the frequent subtrees from a forest of trees. This problem has many application areas. For instance, a huge volume of data available from the In...
124
click to vote
ICDM
2006
IEEE
15 years 10 months ago
2006
IEEE
Recently, there has been considerable interest in computing strongly correlated pairs in large databases. Most previous studies require the specification of a minimum correlation...
141
click to vote
ICDM
2002
IEEE
15 years 8 months ago
2002
IEEE
In this paper, we propose a new framework for mining frequent patterns from large transactional databases. The core of the framework is of a novel coded prefix-path tree with two...
135
click to vote
SDM
2007
SIAM
15 years 5 months ago
2007
SIAM
In this paper we formulate spectral clustering in directed graphs as an optimization problem, the objective being a weighted cut in the directed graph. This objective extends seve...