Sciweavers

110 search results - page 21 / 22
» XAR-miner: efficient association rules mining for XML data
Sort
View
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
14 years 10 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han
DAWAK
1999
Springer
14 years 2 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 ...
CINQ
2004
Springer
116views Database» more  CINQ 2004»
14 years 1 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ç...
JIIS
2000
111views more  JIIS 2000»
13 years 9 months ago
Multidimensional Index Structures in Relational Databases
Abstract. 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 effi...
Christian Böhm, Stefan Berchtold, Hans-Peter ...
HPCC
2007
Springer
14 years 4 months ago
A Data Imputation Model in Sensor Databases
Data missing is a common problem in database query processing, which can cause bias or lead to inefficient analyses, and this problem happens more often in sensor databases. The re...
Nan Jiang