Sciweavers

14704 search results - page 2675 / 2941
» computing 2007
Sort
View
SDM
2007
SIAM
137views Data Mining» more  SDM 2007»
15 years 5 months ago
Are approximation algorithms for consensus clustering worthwhile?
Consensus clustering has emerged as one of the principal clustering problems in the data mining community. In recent years the theoretical computer science community has generated...
Michael Bertolacci, Anthony Wirth
SDM
2007
SIAM
152views Data Mining» more  SDM 2007»
15 years 5 months ago
HP2PC: Scalable Hierarchically-Distributed Peer-to-Peer Clustering
In distributed data mining models, adopting a flat node distribution model can affect scalability. To address the problem of modularity, flexibility and scalability, we propose...
Khaled M. Hammouda, Mohamed S. Kamel
SDM
2007
SIAM
204views Data Mining» more  SDM 2007»
15 years 5 months ago
Flexible Anonymization For Privacy Preserving Data Publishing: A Systematic Search Based Approach
k-anonymity is a popular measure of privacy for data publishing: It measures the risk of identity-disclosure of individuals whose personal information are released in the form of ...
Bijit Hore, Ravi Chandra Jammalamadaka, Sharad Meh...
SDM
2007
SIAM
106views Data Mining» more  SDM 2007»
15 years 5 months ago
Approximating Representations for Large Numerical Databases
The paper introduces a notion of support for realvalued functions. It is shown how to approximate supports of a large class of functions based on supports of so called polynomial ...
Szymon Jaroszewicz, Marcin Korzen
SDM
2007
SIAM
171views Data Mining» more  SDM 2007»
15 years 5 months ago
A Better Alternative to Piecewise Linear Time Series Segmentation
Time series are difficult to monitor, summarize and predict. Segmentation organizes time series into few intervals having uniform characteristics (flatness, linearity, modality,...
Daniel Lemire
« Prev « First page 2675 / 2941 Last » Next »