Sciweavers

2421 search results - page 179 / 485
» Measuring independence of datasets
Sort
View
ADBIS
2009
Springer
162views Database» more  ADBIS 2009»
15 years 10 months ago
Efficient Set Similarity Joins Using Min-prefixes
Identification of all objects in a dataset whose similarity is not less than a specified threshold is of major importance for management, search, and analysis of data. Set similari...
Leonardo Ribeiro, Theo Härder
KDD
2010
ACM
279views Data Mining» more  KDD 2010»
15 years 10 months ago
Unifying dependent clustering and disparate clustering for non-homogeneous data
Modern data mining settings involve a combination of attributevalued descriptors over entities as well as specified relationships between these entities. We present an approach t...
M. Shahriar Hossain, Satish Tadepalli, Layne T. Wa...
KDD
2010
ACM
265views Data Mining» more  KDD 2010»
15 years 10 months ago
Combining predictions for accurate recommender systems
We analyze the application of ensemble learning to recommender systems on the Netflix Prize dataset. For our analysis we use a set of diverse state-of-the-art collaborative filt...
Michael Jahrer, Andreas Töscher, Robert Legen...
ICML
1994
IEEE
15 years 10 months ago
Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithms
With the goal of reducing computational costs without sacrificing accuracy, we describe two algorithms to find sets of prototypes for nearest neighbor classification. Here, the te...
David B. Skalak
CIVR
2008
Springer
166views Image Analysis» more  CIVR 2008»
15 years 8 months ago
Non-negative matrix factorisation for object class discovery and image auto-annotation
In information retrieval, sub-space techniques are usually used to reveal the latent semantic structure of a data-set by projecting it to a low dimensional space. Non-negative mat...
Jiayu Tang, Paul H. Lewis