Sciweavers

1492 search results - page 244 / 299
» Geometric Clustering Using the Information Bottleneck Method
Sort
View

Publication
197views
13 years 5 months ago
Convex non-negative matrix factorization for massive datasets
Non-negative matrix factorization (NMF) has become a standard tool in data mining, information retrieval, and signal processing. It is used to factorize a non-negative data matrix ...
C. Thurau, K. Kersting, M. Wahabzada, and C. Bauck...
WWW
2010
ACM
15 years 4 months ago
Empirical comparison of algorithms for network community detection
Detecting clusters or communities in large real-world graphs such as large social or information networks is a problem of considerable interest. In practice, one typically chooses...
Jure Leskovec, Kevin J. Lang, Michael W. Mahoney
ICMLA
2007
14 years 11 months ago
SVMotif: A Machine Learning Motif Algorithm
We describe SVMotif, a support vector machine-based learning algorithm for identification of cellular DNA transcription factor (TF) motifs extrapolated from known TF-gene interact...
Mark A. Kon, Yue Fan, Dustin T. Holloway, Charles ...
ECIR
2006
Springer
14 years 11 months ago
Automatic Document Organization in a P2P Environment
Abstract. This paper describes an efficient method to construct reliable machine learning applications in peer-to-peer (P2P) networks by building ensemble based meta methods. We co...
Stefan Siersdorfer, Sergej Sizov
BMCBI
2006
157views more  BMCBI 2006»
14 years 9 months ago
Determination of the minimum number of microarray experiments for discovery of gene expression patterns
Background: One type of DNA microarray experiment is discovery of gene expression patterns for a cell line undergoing a biological process over a series of time points. Two import...
Fang-Xiang Wu, W. J. Zhang, Anthony J. Kusalik