Sciweavers

378 search results - page 37 / 76
» An objective evaluation criterion for clustering
Sort
View
ICDM
2007
IEEE
176views Data Mining» more  ICDM 2007»
14 years 26 days ago
A Compact Representation of Spatio-Temporal Data
As technology advances we encounter more available data on moving objects, which can be mined to our benefit. In order to efficiently mine this large amount of data we propose an ...
Sigal Elnekave, Mark Last, Oded Maimon
PAKDD
2005
ACM
112views Data Mining» more  PAKDD 2005»
14 years 2 months ago
Approximated Clustering of Distributed High-Dimensional Data
In many modern application ranges high-dimensional feature vectors are used to model complex real-world objects. Often these objects reside on different local sites. In this paper,...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
CORR
2011
Springer
175views Education» more  CORR 2011»
13 years 4 months ago
A Novel Probabilistic Pruning Approach to Speed Up Similarity Queries in Uncertain Databases
Abstract— In this paper, we propose a novel, effective and efficient probabilistic pruning criterion for probabilistic similarity queries on uncertain data. Our approach support...
Thomas Bernecker, Tobias Emrich, Hans-Peter Kriege...
ASPDAC
2004
ACM
85views Hardware» more  ASPDAC 2004»
14 years 23 days ago
Multi-level placement with circuit schema based clustering in analog IC layouts
This paper aims at developing an automated device-level placement for analog circuit design which achieves comparable quality to manual designs by experts. It extracts a set of cl...
Takashi Nojima, Xiaoke Zhu, Yasuhiro Takashima, Sh...
KDD
2002
ACM
138views Data Mining» more  KDD 2002»
14 years 9 months ago
Learning to match and cluster large high-dimensional data sets for data integration
Part of the process of data integration is determining which sets of identifiers refer to the same real-world entities. In integrating databases found on the Web or obtained by us...
William W. Cohen, Jacob Richman