Sciweavers

195 search results - page 36 / 39
» Clustering-Based K-Anonymisation Algorithms
Sort
View
SSDBM
2005
IEEE
159views Database» more  SSDBM 2005»
15 years 3 months ago
Clustering Moving Objects via Medoid Clusterings
Modern geographic information systems do not only have to handle static information but also dynamically moving objects. Clustering algorithms for these moving objects provide new...
Hans-Peter Kriegel, Martin Pfeifle
HT
2005
ACM
15 years 3 months ago
As we may perceive: inferring logical documents from hypertext
In recent years, many algorithms for the Web have been developed that work with information units distinct from individual web pages. These include segments of web pages or aggreg...
Pavel Dmitriev, Carl Lagoze, Boris Suchkov
SAC
2004
ACM
15 years 3 months ago
Time-frequency feature detection for time-course microarray data
Gene clustering based on microarray data provides useful functional information to the working biologists. Many current gene-clustering algorithms rely on Euclidean-based distance...
Jiawu Feng, Paolo Emilio Barbano, Bud Mishra
DATAMINE
2006
224views more  DATAMINE 2006»
14 years 9 months ago
Characteristic-Based Clustering for Time Series Data
With the growing importance of time series clustering research, particularly for similarity searches amongst long time series such as those arising in medicine or finance, it is cr...
Xiaozhe Wang, Kate A. Smith, Rob J. Hyndman
107
Voted
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
15 years 10 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan