Sciweavers

969 search results - page 80 / 194
» Expectation-MiniMax Approach to Clustering Analysis
Sort
View
KDD
2004
ACM
237views Data Mining» more  KDD 2004»
16 years 4 months ago
Bayesian Model-Averaging in Unsupervised Learning From Microarray Data
Unsupervised identification of patterns in microarray data has been a productive approach to uncovering relationships between genes and the biological process in which they are in...
Mario Medvedovic, Junhai Guo
132
Voted
ICALP
2004
Springer
15 years 9 months ago
Sublinear-Time Approximation for Clustering Via Random Sampling
Abstract. In this paper we present a novel analysis of a random sampling approach for three clustering problems in metric spaces: k-median, min-sum kclustering, and balanced k-medi...
Artur Czumaj, Christian Sohler
146
Voted
WAIM
2001
Springer
15 years 8 months ago
Link Based Clustering of Web Search Results
Abstract. With information proliferation on the Web, how to obtain highquality information from the Web has been one of hot research topics in many fields like Database, IR as well...
Yitong Wang, Masaru Kitsuregawa
CORR
2010
Springer
193views Education» more  CORR 2010»
15 years 2 months ago
A Probabilistic Approach for Learning Folksonomies from Structured Data
Learning structured representations has emerged as an important problem in many domains, including document and Web data mining, bioinformatics, and image analysis. One approach t...
Anon Plangprasopchok, Kristina Lerman, Lise Getoor
154
Voted
EDBT
2012
ACM
228views Database» more  EDBT 2012»
13 years 6 months ago
Finding maximal k-edge-connected subgraphs from a large graph
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
Rui Zhou, Chengfei Liu, Jeffrey Xu Yu, Weifa Liang...