438 search results - page 24 / 88 » Data Structure and Algorithm in Data Mining: Granular Comput... |
SAC
2002
ACM
13 years 7 months ago
2002
ACM
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...
SDM
2003
SIAM
13 years 8 months ago
2003
SIAM
This paper presents a general framework for adapting any generative (model-based) clustering algorithm to provide balanced solutions, i.e., clusters of comparable sizes. Partition...
KDD
2006
ACM
14 years 8 months ago
2006
ACM
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
SIGMOD
1996
ACM
13 years 11 months ago
1996
ACM
Detecting and representing changes to data is important for active databases, data warehousing, view maintenance, and version and configuration management. Most previous work in c...
PAKDD
2009
ACM
14 years 4 months ago
2009
ACM
Since mining frequent patterns from transactional databases involves an exponential mining space and generates a huge number of patterns, efficient discovery of user-interest-based...