Sciweavers

245 search results - page 41 / 49
» Efficient Algorithms for Discovering Association Rules
Sort
View
IQIS
2004
ACM
14 years 29 days ago
Mining for Patterns in Contradictory Data
Information integration is often faced with the problem that different data sources represent the same set of the real-world objects, but give conflicting values for specific prop...
Heiko Müller, Ulf Leser, Johann Christoph Fre...
KDD
1995
ACM
67views Data Mining» more  KDD 1995»
13 years 11 months ago
A Perspective on Databases and Data Mining
We discuss the use of database met hods for data mining. Recently impressive results have been achieved for some data mining problems using highly specialized and clever data stru...
Marcel Holsheimer, Martin L. Kersten, Heikki Manni...
DAWAK
1999
Springer
13 years 12 months ago
Implementation of Multidimensional Index Structures for Knowledge Discovery in Relational Databases
Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on efficient quer...
Stefan Berchtold, Christian Böhm, Hans-Peter ...
KDD
2006
ACM
198views Data Mining» more  KDD 2006»
14 years 8 months ago
CFI-Stream: mining closed frequent itemsets in data streams
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent clo...
Nan Jiang, Le Gruenwald
ICIP
2010
IEEE
13 years 5 months ago
Building Emerging Pattern (EP) Random forest for recognition
The Random forest classifier comes to be the working horse for visual recognition community. It predicts the class label of an input data by aggregating the votes of multiple tree...
Liang Wang, Yizhou Wang, Debin Zhao