Sciweavers

1301 search results - page 24 / 261
» Default Clustering from Sparse Data Sets
Sort
View
VLDB
2005
ACM
118views Database» more  VLDB 2005»
14 years 2 months ago
Selectivity Estimation for Fuzzy String Predicates in Large Data Sets
Many database applications have the emerging need to support fuzzy queries that ask for strings that are similar to a given string, such as “name similar to smith” and “tele...
Liang Jin, Chen Li
EUSFLAT
2009
163views Fuzzy Logic» more  EUSFLAT 2009»
13 years 6 months ago
A Fuzzy Set Approach to Ecological Knowledge Discovery
Besides the problem of searching for effective methods for extracting knowledge from large databases (KDD) there are some additional problems with handling ecological data, namely ...
Arkadiusz Salski
SADM
2008
165views more  SADM 2008»
13 years 8 months ago
Global Correlation Clustering Based on the Hough Transform
: In this article, we propose an efficient and effective method for finding arbitrarily oriented subspace clusters by mapping the data space to a parameter space defining the set o...
Elke Achtert, Christian Böhm, Jörn David...
ICMLA
2008
13 years 10 months ago
A Weighted Distance Measure for Calculating the Similarity of Sparsely Distributed Trajectories
This article presents a method for the calculating similarity of two trajectories. The method is especially designed for a situation where the points of the trajectories are distr...
Pekka Siirtola, Perttu Laurinen, Juha Röning
INCDM
2010
Springer
172views Data Mining» more  INCDM 2010»
13 years 7 months ago
Evaluating the Quality of Clustering Algorithms Using Cluster Path Lengths
Many real world systems can be modeled as networks or graphs. Clustering algorithms that help us to organize and understand these networks are usually referred to as, graph based c...
Faraz Zaidi, Daniel Archambault, Guy Melanç...