Sciweavers

1731 search results - page 132 / 347
» Maximum likelihood analysis of algorithms and data structure...
Sort
View
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
14 years 8 months ago
Structured metric learning for high dimensional problems
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
Jason V. Davis, Inderjit S. Dhillon
IJCAI
2007
13 years 9 months ago
Locality Sensitive Discriminant Analysis
Linear Discriminant Analysis (LDA) is a popular data-analytic tool for studying the class relationship between data points. A major disadvantage of LDA is that it fails to discove...
Deng Cai, Xiaofei He, Kun Zhou, Jiawei Han, Hujun ...
ICDM
2002
IEEE
156views Data Mining» more  ICDM 2002»
14 years 1 months ago
Association Analysis with One Scan of Databases
Mining frequent patterns with an FP-tree avoids costly candidate generation and repeatedly occurrence frequency checking against the support threshold. It therefore achieves bette...
Hao Huang, Xindong Wu, Richard Relue
IJON
1998
158views more  IJON 1998»
13 years 8 months ago
Bayesian Kullback Ying-Yang dependence reduction theory
Bayesian Kullback Ying—Yang dependence reduction system and theory is presented. Via stochastic approximation, implementable algorithms and criteria are given for parameter lear...
Lei Xu
SWAT
1994
Springer
120views Algorithms» more  SWAT 1994»
14 years 10 days ago
Parallel Dynamic Lowest Common Ancestors
This paper gives a CREW PRAM algorithm for the problem of finding lowest common ancestors in a forest under the insertion of leaves and roots and the deletion of leaves. For a fore...
Erik Schenk