Sciweavers

1768 search results - page 31 / 354
» Mining Very Large Databases
Sort
View
DAWAK
2004
Springer
14 years 3 months ago
A Tree Partitioning Method for Memory Management in Association Rule Mining
All methods of association rule mining require the frequent sets of items, that occur together sufficiently often to be the basis of potentially interesting rules, to be first com...
Shakil Ahmed, Frans Coenen, Paul H. Leng
KDD
1995
ACM
140views Data Mining» more  KDD 1995»
14 years 1 months ago
Discovery and Maintenance of Functional Dependencies by Independencies
For semantic query optimization one needs detailed knowledgeabout the contents of the database. Traditional techniquesuse static knowledgeabout all possible states of the database...
Siegfried Bell
ICDE
2002
IEEE
146views Database» more  ICDE 2002»
14 years 11 months ago
Data Mining Meets Performance Evaluation: Fast Algorithms for Modeling Bursty Traffic
Network, web, and disk I/O traffic are usually bursty, self-similar [9, 3, 5, 6] and therefore can not be modeled adequately with Poisson arrivals[9]. However, we do want to model...
Mengzhi Wang, Ngai Hang Chan, Spiros Papadimitriou...
VLDB
2008
ACM
147views Database» more  VLDB 2008»
14 years 10 months ago
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
KDD
1999
ACM
220views Data Mining» more  KDD 1999»
14 years 2 months ago
Efficient Mining of Emerging Patterns: Discovering Trends and Differences
We introduce a new kind of patterns, called emerging patterns (EPs), for knowledge discovery from databases. EPs are defined as itemsets whose supports increase significantly from...
Guozhu Dong, Jinyan Li