Sciweavers

610 search results - page 22 / 122
» A Novel Framework for Discovering Robust Cluster Results
Sort
View
TREC
2003
13 years 10 months ago
Ranking Function Discovery by Genetic Programming for Robust Retrieval
Ranking functions are instrumental for the success of an information retrieval (search engine) system. However nearly all existing ranking functions are manually designed based on...
Li Wang, Weiguo Fan, Rui Yang, Wensi Xi, Ming Luo,...
ACL
2010
13 years 6 months ago
Mood Patterns and Affective Lexicon Access in Weblogs
The emergence of social media brings chances, but also challenges, to linguistic analysis. In this paper we investigate a novel problem of discovering patterns based on emotion an...
Thin Nguyen
BMCBI
2006
144views more  BMCBI 2006»
13 years 8 months ago
More robust detection of motifs in coexpressed genes by using phylogenetic information
Background: Several motif detection algorithms have been developed to discover overrepresented motifs in sets of coexpressed genes. However, in a noisy gene list, the number of ge...
Pieter Monsieurs, Gert Thijs, Abeer A. Fadda, Sigr...
BMCBI
2005
169views more  BMCBI 2005»
13 years 8 months ago
Genetic interaction motif finding by expectation maximization - a novel statistical model for inferring gene modules from synthe
Background: Synthetic lethality experiments identify pairs of genes with complementary function. More direct functional associations (for example greater probability of membership...
Yan Qi 0003, Ping Ye, Joel S. Bader
ICDM
2007
IEEE
149views Data Mining» more  ICDM 2007»
14 years 3 months ago
Non-redundant Multi-view Clustering via Orthogonalization
Typical clustering algorithms output a single clustering of the data. However, in real world applications, data can often be interpreted in many different ways; data can have diff...
Ying Cui, Xiaoli Z. Fern, Jennifer G. Dy