Sciweavers

766 search results - page 90 / 154
» Clustering high dimensional data using subspace and projecte...
Sort
View
ICDM
2008
IEEE
230views Data Mining» more  ICDM 2008»
14 years 3 months ago
Clustering Distributed Time Series in Sensor Networks
Event detection is a critical task in sensor networks, especially for environmental monitoring applications. Traditional solutions to event detection are based on analyzing one-sh...
Jie Yin, Mohamed Medhat Gaber
HIS
2004
13 years 10 months ago
Adaptive Boosting with Leader based Learners for Classification of Large Handwritten Data
Boosting is a general method for improving the accuracy of a learning algorithm. AdaBoost, short form for Adaptive Boosting method, consists of repeated use of a weak or a base le...
T. Ravindra Babu, M. Narasimha Murty, Vijay K. Agr...
ICDM
2009
IEEE
130views Data Mining» more  ICDM 2009»
13 years 6 months ago
Efficient Anonymizations with Enhanced Utility
The k-anonymization method is a commonly used privacy-preserving technique. Previous studies used various measures of utility that aim at enhancing the correlation between the orig...
Jacob Goldberger, Tamir Tassa
ECML
2007
Springer
14 years 2 months ago
Principal Component Analysis for Large Scale Problems with Lots of Missing Values
Abstract. Principal component analysis (PCA) is a well-known classical data analysis technique. There are a number of algorithms for solving the problem, some scaling better than o...
Tapani Raiko, Alexander Ilin, Juha Karhunen
DMIN
2009
180views Data Mining» more  DMIN 2009»
13 years 6 months ago
APHID: A Practical Architecture for High-Performance, Privacy-Preserving Data Mining
While the emerging field of privacy preserving data mining (PPDM) will enable many new data mining applications, it suffers from several practical difficulties. PPDM algorithms are...
Jimmy Secretan, Anna Koufakou, Michael Georgiopoul...