Sciweavers

4085 search results - page 438 / 817
» Benchmarking Data Mining Algorithms
Sort
View
KDD
2004
ACM
150views Data Mining» more  KDD 2004»
16 years 5 months ago
A framework for ontology-driven subspace clustering
Traditional clustering is a descriptive task that seeks to identify homogeneous groups of objects based on the values of their attributes. While domain knowledge is always the bes...
Jinze Liu, Wei Wang 0010, Jiong Yang
146
Voted
PAKDD
2010
ACM
169views Data Mining» more  PAKDD 2010»
15 years 7 months ago
Correspondence Clustering: An Approach to Cluster Multiple Related Spatial Datasets
Domain experts are frequently interested to analyze multiple related spatial datasets. This capability is important for change analysis and contrast mining. In this paper, a novel ...
Vadeerat Rinsurongkawong, Christoph F. Eick
GIS
2006
ACM
16 years 6 months ago
ST-ACTS: a spatio-temporal activity simulator
Creating complex spatio?temporal simulation models is a hot issue in the area of spatio?temporal databases [7]. While existing Moving Object Simulators (MOSs) address different ph...
Gyözö Gidófalvi, Torben Bach Pede...
DBA
2006
182views Database» more  DBA 2006»
15 years 6 months ago
Matrix Apriori: Speeding Up the Search for Frequent Patterns
This work discusses the problem of generating association rules from a set of transactions in a relational database, taking performance and accuracy of found results as the essent...
Judith Pavón, Sidney Viana, Santiago G&oacu...
145
Voted
ISCI
2006
58views more  ISCI 2006»
15 years 5 months ago
Streaming data reduction using low-memory factored representations
Many special purpose algorithms exist for extracting information from streaming data. Constraints are imposed on the total memory and on the average processing time per data item....
David Littau, Daniel Boley