Sciweavers

51 search results - page 8 / 11
» Mining Association Rules with systolic trees
Sort
View
SAC
2002
ACM
13 years 6 months ago
The P-tree algebra
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
Qin Ding, Maleq Khan, Amalendu Roy, William Perriz...
HIPC
1999
Springer
13 years 11 months ago
High Performance Data Mining
Abstract. Recent times have seen an explosive growth in the availability of various kinds of data. It has resulted in an unprecedented opportunity to develop automated data-driven ...
Vipin Kumar, Jaideep Srivastava
ICDE
2008
IEEE
153views Database» more  ICDE 2008»
14 years 8 months ago
Mining Views: Database Views for Data Mining
We present a system towards the integration of data mining into relational databases. To this end, a relational database model is proposed, based on the so called virtual mining vi...
Élisa Fromont, Adriana Prado, Bart Goethals...
ICWE
2004
Springer
14 years 11 days ago
Behaviour Recovery and Complicated Pattern Definition in Web Usage Mining
Data mining includes four steps: data preparation, pattern mining, and pattern analysis and pattern application. But in web environment, the user activities become much more comple...
Long Wang 0002, Christoph Meinel
AUSDM
2007
Springer
193views Data Mining» more  AUSDM 2007»
14 years 1 months ago
Are Zero-suppressed Binary Decision Diagrams Good for Mining Frequent Patterns in High Dimensional Datasets?
Mining frequent patterns such as frequent itemsets is a core operation in many important data mining tasks, such as in association rule mining. Mining frequent itemsets in high-di...
Elsa Loekito, James Bailey