Sciweavers

2932 search results - page 246 / 587
» Higher order mining
Sort
View
SDM
2007
SIAM
107views Data Mining» more  SDM 2007»
15 years 8 months ago
On Demand Phenotype Ranking through Subspace Clustering
High throughput biotechnologies have enabled scientists to collect a large number of genetic and phenotypic attributes for a large collection of samples. Computational methods are...
Xiang Zhang, Wei Wang 0010, Jun Huan
DKE
2006
125views more  DKE 2006»
15 years 6 months ago
Online clustering of parallel data streams
In recent years, the management and processing of so-called data streams has become a topic of active research in several fields of computer science such as, e.g., distributed sys...
Jürgen Beringer, Eyke Hüllermeier
SAC
2002
ACM
15 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...
SISAP
2010
IEEE
243views Data Mining» more  SISAP 2010»
15 years 4 months ago
Similarity matrix compression for efficient signature quadratic form distance computation
Determining similarities among multimedia objects is a fundamental task in many content-based retrieval, analysis, mining, and exploration applications. Among state-of-the-art sim...
Christian Beecks, Merih Seran Uysal, Thomas Seidl
PKDD
1999
Springer
106views Data Mining» more  PKDD 1999»
15 years 11 months ago
Heuristic Measures of Interestingness
When mining a large database, the number of patterns discovered can easily exceed the capabilities of a human user to identify interesting results. To address this problem, variou...
Robert J. Hilderman, Howard J. Hamilton