Sciweavers

1403 search results - page 71 / 281
» Set cover algorithms for very large datasets
Sort
View
WAIM
2005
Springer
15 years 3 months ago
Similarity Search with Implicit Object Features
Driven by many real applications, in this paper we study the problem of similarity search with implicit object features; that is, the features of each object are not pre-computed/e...
Yi Luo, Zheng Liu, Xuemin Lin, Wei Wang 0011, Jeff...
KAIS
2006
126views more  KAIS 2006»
14 years 9 months ago
Fast and exact out-of-core and distributed k-means clustering
Clustering has been one of the most widely studied topics in data mining and k-means clustering has been one of the popular clustering algorithms. K-means requires several passes ...
Ruoming Jin, Anjan Goswami, Gagan Agrawal
ICDM
2010
IEEE
122views Data Mining» more  ICDM 2010»
14 years 7 months ago
Interesting Subset Discovery and Its Application on Service Processes
Various real-life datasets can be viewed as a set of records consisting of attributes explaining the records and set of measures evaluating the records. In this paper, we address t...
Maitreya Natu, Girish Keshav Palshikar
BIOCOMP
2006
14 years 11 months ago
A Heuristic Approach to Scoring Gene Clustering Algorithms
In the past decades, many clustering algorithms have been proposed for the analysis of gene expression data, but little guidance is available to help choose among them. Given the ...
Longde Yin, Chun-Hsi Huang
EDBT
2009
ACM
122views Database» more  EDBT 2009»
15 years 1 months ago
Finding the influence set through skylines
Given a set P of products, a set O of customers, and a product p P, a bichromatic reverse skyline query retrieves all the customers in O that do not find any other product in P t...
Xiaobing Wu, Yufei Tao, Raymond Chi-Wing Wong, Lin...