Sciweavers

188 search results - page 29 / 38
» Finding Best k Policies
Sort
View
ICML
2010
IEEE
13 years 11 months ago
Variable Selection in Model-Based Clustering: To Do or To Facilitate
Variable selection for cluster analysis is a difficult problem. The difficulty originates not only from the lack of class information but also the fact that high-dimensional data ...
Leonard K. M. Poon, Nevin Lianwen Zhang, Tao Chen,...
IJWET
2008
108views more  IJWET 2008»
13 years 9 months ago
Web service workflow selection using system and network QoS constraints
: Web services serve as a leading technology platform for web-based data-centric environments providing flexibility of loose coupling, message-based communication. Interest in more...
Yannis Panagis, Konstantinos Papakonstantinou, Eva...
TPDS
2002
80views more  TPDS 2002»
13 years 9 months ago
Performance Optimization Problem in Speculative Prefetching
Speculative prefetching has been proposed to improve the response time of network access. Previous studies in speculative prefetching focus on building and evaluating access models...
Nor Jaidi Tuah, Mohan Kumar, Svetha Venkatesh, Saj...
EDBT
2010
ACM
135views Database» more  EDBT 2010»
13 years 7 months ago
Querying spatial patterns
Spatial data are common in many scientific and commercial domains such as geographical information systems and gene/protein expression profiles. Querying for distribution patterns...
Vishwakarma Singh, Arnab Bhattacharya, Ambuj K. Si...
CLASSIFICATION
2010
13 years 7 months ago
Intelligent Choice of the Number of Clusters in K-Means Clustering: An Experimental Study with Different Cluster Spreads
: The issue of determining "the right number of clusters" in K-Means has attracted considerable interest, especially in the recent years. Cluster intermix appears to be a...
Mark Ming-Tso Chiang, Boris Mirkin