Sciweavers

1951 search results - page 235 / 391
» An algorithm for improving graph partitions
Sort
View
FOCS
2008
IEEE
15 years 11 months ago
Submodular Approximation: Sampling-based Algorithms and Lower Bounds
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
Zoya Svitkina, Lisa Fleischer
SASO
2008
IEEE
15 years 11 months ago
Empirical Characterization of Discretization Error in Gradient-Based Algorithms
Many self-organizing and self-adaptive systems use the biologically inspired “gradient” primitive, in which each device in a network estimates its distance to the closest devi...
Jonathan Bachrach, Jacob Beal, Joshua Horowitz, Da...
ICDM
2005
IEEE
215views Data Mining» more  ICDM 2005»
15 years 10 months ago
CLUGO: A Clustering Algorithm for Automated Functional Annotations Based on Gene Ontology
We address the issue of providing highly informative and comprehensive annotations using information revealed by the structured vocabularies of Gene Ontology (GO). For a target, a...
In-Yee Lee, Jan-Ming Ho, Ming-Syan Chen
WEBI
2004
Springer
15 years 10 months ago
TSSP: A Reinforcement Algorithm to Find Related Papers
Content analysis and citation analysis are two common methods in recommending system. Compared with content analysis, citation analysis can discover more implicitly related papers...
Shen Huang, Gui-Rong Xue, Benyu Zhang, Zheng Chen,...
KDD
2004
ACM
132views Data Mining» more  KDD 2004»
16 years 5 months ago
A probabilistic framework for semi-supervised clustering
Unsupervised clustering can be significantly improved using supervision in the form of pairwise constraints, i.e., pairs of instances labeled as belonging to same or different clu...
Sugato Basu, Mikhail Bilenko, Raymond J. Mooney