Sciweavers

642 search results - page 11 / 129
» Least-Squares Structuring, Clustering and Data Processing Is...
Sort
View
KDD
2007
ACM
178views Data Mining» more  KDD 2007»
14 years 9 months ago
Density-based clustering for real-time stream data
Existing data-stream clustering algorithms such as CluStream are based on k-means. These clustering algorithms are incompetent to find clusters of arbitrary shapes and cannot hand...
Yixin Chen, Li Tu
PRL
2010
158views more  PRL 2010»
13 years 7 months ago
Data clustering: 50 years beyond K-means
: Organizing data into sensible groupings is one of the most fundamental modes of understanding and learning. As an example, a common scheme of scientific classification puts organ...
Anil K. Jain
JGTOOLS
2008
100views more  JGTOOLS 2008»
13 years 8 months ago
Proximity Cluster Trees
Hierarchical spatial data structures provide a means for organizing data for efficient processing. Most spatial data structures are optimized for performing queries, such as inters...
Elena Jakubiak Hutchinson, Sarah F. Frisken, Ronal...
ICIP
2002
IEEE
14 years 10 months ago
Probabilistic home video structuring: feature selection and performance evaluation
We recently proposed a method to find cluster structure in home videos based on statistical models of visual and temporal features of video segments and sequential binary Bayesian...
Daniel Gatica-Perez, Alexander C. Loui, Ming-Ting ...
ER
2004
Springer
107views Database» more  ER 2004»
14 years 2 months ago
A Scaleless Data Model for Direct and Progressive Spatial Query Processing
A progressive spatial query retrieves spatial data based on previous queries (e.g., to fetch data in a more restricted area with higher resolution). A direct query, on the other si...
Sai Sun, Sham Prasher, Xiaofang Zhou