Sciweavers

1405 search results - page 90 / 281
» Popularity at Minimum Cost
Sort
View
ICML
2007
IEEE
16 years 5 months ago
Best of both: a hybridized centroid-medoid clustering heuristic
Although each iteration of the popular kMeans clustering heuristic scales well to larger problem sizes, it often requires an unacceptably-high number of iterations to converge to ...
Nizar Grira, Michael E. Houle
PODS
2005
ACM
127views Database» more  PODS 2005»
16 years 4 months ago
FTW: fast similarity search under the time warping distance
Time-series data naturally arise in countless domains, such as meteorology, astrophysics, geology, multimedia, and economics. Similarity search is very popular, and DTW (Dynamic T...
Yasushi Sakurai, Masatoshi Yoshikawa, Christos Fal...
AUSAI
2005
Springer
15 years 9 months ago
Ensemble Selection for SuperParent-One-Dependence Estimators
SuperParent-One-Dependence Estimators (SPODEs) loosen Naive-Bayes’ attribute independence assumption by allowing each attribute to depend on a common single attribute (superpare...
Ying Yang, Kevin B. Korb, Kai Ming Ting, Geoffrey ...
ACNS
2003
Springer
156views Cryptology» more  ACNS 2003»
15 years 8 months ago
An Efficient Tree-Based Group Key Agreement Using Bilinear Map
Secure and reliable group communication is an increasingly active research area by growing popularity in group-oriented and collaborative application. One of the important challeng...
Sangwon Lee, Yongdae Kim, Kwangjo Kim, DaeHyun Ryu
ICPR
2010
IEEE
15 years 4 months ago
The Problem of Fragile Feature Subset Preference in Feature Selection Methods and a Proposal of Algorithmic Workaround
Abstract—We point out a problem inherent in the optimization scheme of many popular feature selection methods. It follows from the implicit assumption that higher feature selecti...
Petr Somol, Jiri Grim, Pavel Pudil