Sciweavers

51 search results - page 3 / 11
» Efficient Mining of Frequent and Distinctive Feature Configu...
Sort
View
KDD
2003
ACM
135views Data Mining» more  KDD 2003»
14 years 5 months ago
Efficiently handling feature redundancy in high-dimensional data
High-dimensional data poses a severe challenge for data mining. Feature selection is a frequently used technique in preprocessing high-dimensional data for successful data mining....
Lei Yu, Huan Liu
CINQ
2004
Springer
116views Database» more  CINQ 2004»
13 years 9 months ago
A Survey on Condensed Representations for Frequent Sets
Abstract. Solving inductive queries which have to return complete collections of patterns satisfying a given predicate has been studied extensively the last few years. The specific...
Toon Calders, Christophe Rigotti, Jean-Franç...
DBA
2006
182views Database» more  DBA 2006»
13 years 6 months ago
Matrix Apriori: Speeding Up the Search for Frequent Patterns
This work discusses the problem of generating association rules from a set of transactions in a relational database, taking performance and accuracy of found results as the essent...
Judith Pavón, Sidney Viana, Santiago G&oacu...
KDD
2006
ACM
150views Data Mining» more  KDD 2006»
14 years 5 months ago
Maximally informative k-itemsets and their efficient discovery
In this paper we present a new approach to mining binary data. We treat each binary feature (item) as a means of distinguishing two sets of examples. Our interest is in selecting ...
Arno J. Knobbe, Eric K. Y. Ho
KDD
2008
ACM
192views Data Mining» more  KDD 2008»
14 years 5 months ago
Partial least squares regression for graph mining
Attributed graphs are increasingly more common in many application domains such as chemistry, biology and text processing. A central issue in graph mining is how to collect inform...
Hiroto Saigo, Koji Tsuda, Nicole Krämer