Sciweavers

851 search results - page 139 / 171
» On the Complexity of Mining Association Rules
Sort
View
DAWAK
1999
Springer
14 years 28 days ago
Modeling KDD Processes within the Inductive Database Framework
One of the most challenging problems in data manipulation in the future is to be able to e ciently handle very large databases but also multiple induced properties or generalizatio...
Jean-François Boulicaut, Mika Klemettinen, ...
SDM
2003
SIAM
134views Data Mining» more  SDM 2003»
13 years 10 months ago
Hierarchical Document Clustering using Frequent Itemsets
A major challenge in document clustering is the extremely high dimensionality. For example, the vocabulary for a document set can easily be thousands of words. On the other hand, ...
Benjamin C. M. Fung, Ke Wang, Martin Ester
SAC
2002
ACM
13 years 8 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...
DAC
2010
ACM
13 years 12 months ago
Scalable specification mining for verification and diagnosis
Effective system verification requires good specifications. The lack of sufficient specifications can lead to misses of critical bugs, design re-spins, and time-to-market slips. I...
Wenchao Li, Alessandro Forin, Sanjit A. Seshia
FUIN
2000
109views more  FUIN 2000»
13 years 8 months ago
Building Knowledge Scouts Using KGL Metalanguage
Knowledge scouts are software agents that autonomously search for and synthesize user-oriented knowledge (target knowledge) in large local or distributed databases. A knowledge ge...
Ryszard S. Michalski, Kenneth A. Kaufman