Sciweavers

387 search results - page 16 / 78
» Mining Approximative Descriptions of Sets Using Rough Sets
Sort
View
DASFAA
2008
IEEE
150views Database» more  DASFAA 2008»
14 years 2 months ago
Approximate Clustering of Time Series Using Compact Model-Based Descriptions
Clustering time series is usually limited by the fact that the length of the time series has a significantly negative influence on the runtime. On the other hand, approximative c...
Hans-Peter Kriegel, Peer Kröger, Alexey Pryak...
APPT
2005
Springer
14 years 1 months ago
Principal Component Analysis for Distributed Data Sets with Updating
Identifying the patterns of large data sets is a key requirement in data mining. A powerful technique for this purpose is the principal component analysis (PCA). PCA-based clusteri...
Zheng-Jian Bai, Raymond H. Chan, Franklin T. Luk
RSCTC
2004
Springer
121views Fuzzy Logic» more  RSCTC 2004»
14 years 1 months ago
On the Correspondence between Approximations and Similarity
Abstract. This paper focuses on the use and interpretation of approximate databases where both rough sets and indiscernibility partitions are generalized and replaced by approximat...
Patrick Doherty, Andrzej Szalas
HIS
2004
13 years 9 months ago
Hybrid Learning Scheme for Data Mining Applications
Classification of large datasets is a challenging task in Data Mining. In the current work, we propose a novel method that compresses the data and classifies the test data directl...
T. Ravindra Babu, M. Narasimha Murty, Vijay K. Agr...
CIKM
2004
Springer
14 years 1 months ago
Framework and algorithms for trend analysis in massive temporal data sets
Mining massive temporal data streams for significant trends, emerging buzz, and unusually high or low activity is an important problem with several commercial applications. In th...
Sreenivas Gollapudi, D. Sivakumar