Sciweavers

8614 search results - page 1652 / 1723
» Mining
Sort
View
MLDM
2005
Springer
15 years 11 months ago
Using Clustering to Learn Distance Functions for Supervised Similarity Assessment
Assessing the similarity between objects is a prerequisite for many data mining techniques. This paper introduces a novel approach to learn distance functions that maximizes the c...
Christoph F. Eick, Alain Rouhana, Abraham Bagherje...
MLDM
2005
Springer
15 years 11 months ago
Supervised Evaluation of Dataset Partitions: Advantages and Practice
In the context of large databases, data preparation takes a greater importance : instances and explanatory attributes have to be carefully selected. In supervised learning, instanc...
Sylvain Ferrandiz, Marc Boullé
PKDD
2005
Springer
188views Data Mining» more  PKDD 2005»
15 years 11 months ago
Elastic Partial Matching of Time Series
We consider a problem of elastic matching of time series. We propose an algorithm that automatically determines a subsequence b of a target time series b that best matches a query ...
Longin Jan Latecki, Vasilis Megalooikonomou, Qiang...
PKDD
2005
Springer
123views Data Mining» more  PKDD 2005»
15 years 11 months ago
A Multi-metric Index for Euclidean and Periodic Matching
In many classification and data-mining applications the user does not know a priori which distance measure is the most appropriate for the task at hand without examining the produ...
Michail Vlachos, Zografoula Vagena, Vittorio Caste...
PREMI
2005
Springer
15 years 11 months ago
Geometric Decision Rules for Instance-Based Learning Problems
In the typical nonparametric approach to classification in instance-based learning and data mining, random data (the training set of patterns) are collected and used to design a d...
Binay K. Bhattacharya, Kaustav Mukherjee, Godfried...
« Prev « First page 1652 / 1723 Last » Next »