Sciweavers

2600 search results - page 133 / 520
» Clustering with or without the Approximation
Sort
View
ICDE
2008
IEEE
153views Database» more  ICDE 2008»
16 years 7 months ago
A Framework for Clustering Uncertain Data Streams
Abstract-- In recent years, uncertain data management applications have grown in importance because of the large number of hardware applications which measure data approximately. F...
Charu C. Aggarwal, Philip S. Yu
GLOBECOM
2007
IEEE
16 years 23 days ago
Clustered K-Center: Effective Replica Placement in Peer-to-Peer Systems
Abstract— Peer-to-Peer (P2P) systems provide decentralization, self-organization, scalability and failure-resilience, but suffer from high worst-case latencies. Researchers have ...
Jian Zhou, Xin Zhang, Laxmi N. Bhuyan, Bin Liu
GFKL
2007
Springer
139views Data Mining» more  GFKL 2007»
16 years 18 days ago
The Noise Component in Model-based Cluster Analysis
The so-called noise-component has been introduced by Banfield and Raftery (1993) to improve the robustness of cluster analysis based on the normal mixture model. The idea is to ad...
Christian Hennig, Pietro Coretto
ECML
2006
Springer
15 years 10 months ago
Deconvolutive Clustering of Markov States
In this paper we formulate the problem of grouping the states of a discrete Markov chain of arbitrary order simultaneously with deconvolving its transition probabilities. As the na...
Ata Kabán, Xin Wang
ACID
2006
220views Algorithms» more  ACID 2006»
15 years 7 months ago
Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
Henning Fernau, David Manlove