Sciweavers

42 search results - page 7 / 9
» Fast approximate hierarchical clustering using similarity he...
Sort
View
DASFAA
2008
IEEE
190views Database» more  DASFAA 2008»
13 years 11 months ago
Analysis of Time Series Using Compact Model-Based Descriptions
Abstract. Recently, we have proposed a novel method for the compression of time series based on mathematical models that explore dependencies between different time series. This r...
Hans-Peter Kriegel, Peer Kröger, Alexey Pryak...
IAT
2009
IEEE
14 years 3 days ago
Cluster-Swap: A Distributed K-median Algorithm for Sensor Networks
In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and power limitations....
Yoonheui Kim, Victor R. Lesser, Deepak Ganesan, Ra...
KAIS
2000
87views more  KAIS 2000»
13 years 5 months ago
An Index Structure for Data Mining and Clustering
Abstract. In this paper we present an index structure, called MetricMap, that takes a set of objects and a distance metric and then maps those objects to a k-dimensional space in s...
Xiong Wang, Jason Tsong-Li Wang, King-Ip Lin, Denn...
EDBT
2008
ACM
151views Database» more  EDBT 2008»
14 years 5 months ago
Fast contextual preference scoring of database tuples
To provide users with only relevant data from the huge amount of available information, personalization systems utilize preferences to allow users to express their interest on spe...
Kostas Stefanidis, Evaggelia Pitoura
BMCBI
2006
141views more  BMCBI 2006»
13 years 5 months ago
Asymptotic behaviour and optimal word size for exact and approximate word matches between random sequences
Background: The number of k-words shared between two sequences is a simple and effcient alignment-free sequence comparison method. This statistic, D2, has been used for the cluste...
Sylvain Forêt, Miriam R. Kantorovitz, Conrad...