Sciweavers

4085 search results - page 558 / 817
» Benchmarking Data Mining Algorithms
Sort
View
DAWAK
2005
Springer
16 years 18 days ago
FMC: An Approach for Privacy Preserving OLAP
To preserve private information while providing thorough analysis is one of the significant issues in OLAP systems. One of the challenges in it is to prevent inferring the sensitiv...
Ming Hua, Shouzhi Zhang, Wei Wang 0009, Haofeng Zh...
ADBIS
2007
Springer
132views Database» more  ADBIS 2007»
16 years 1 months ago
Clustering Approach to Generalized Pattern Identification Based on Multi-instanced Objects with DARA
Clustering is an essential data mining task with various types of applications. Traditional clustering algorithms are based on a vector space model representation. A relational dat...
Rayner Alfred, Dimitar Kazakov
EDBT
2004
ACM
142views Database» more  EDBT 2004»
16 years 7 months ago
Iterative Incremental Clustering of Time Series
We present a novel anytime version of partitional clustering algorithm, such as k-Means and EM, for time series. The algorithm works by leveraging off the multi-resolution property...
Jessica Lin, Michail Vlachos, Eamonn J. Keogh, Dim...
INFOCOM
2009
IEEE
16 years 1 months ago
Fair Routing in Delay Tolerant Networks
—The typical state-of-the-art routing algorithms for delay tolerant networks are based on best next hop hill-climbing heuristics in order to achieve throughput and efficiency. T...
Josep M. Pujol, Alberto Lopez Toledo, Pablo Rodrig...
SDM
2009
SIAM
175views Data Mining» more  SDM 2009»
16 years 4 months ago
Low-Entropy Set Selection.
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
Hannes Heikinheimo, Jilles Vreeken, Arno Siebes, H...