Sciweavers

45 search results - page 4 / 9
» Hypernym Discovery Based on Distributional Similarity and Hi...
Sort
View
WSDM
2012
ACM
207views Data Mining» more  WSDM 2012»
12 years 3 months ago
Sequence clustering and labeling for unsupervised query intent discovery
One popular form of semantic search observed in several modern search engines is to recognize query patterns that trigger instant answers or domain-specific search, producing sem...
Jackie Chi Kit Cheung, Xiao Li
SAC
2009
ACM
14 years 2 months ago
Using geo-spatial session tagging for smart multicast session discovery
IP multicast is increasingly seen as efficient mode of live content distribution in the Internet to significantly large subscriber bases. Despite its numerous benefits over IP u...
Piyush Harsh, Richard Newman
CIBB
2008
13 years 9 months ago
Unsupervised Stability-Based Ensembles to Discover Reliable Structures in Complex Bio-molecular Data
The assessment of the reliability of clusters discovered in bio-molecular data is a central issue in several bioinformatics problems. Several methods based on the concept of stabil...
Alberto Bertoni, Giorgio Valentini
RECOMB
2008
Springer
14 years 7 months ago
BayCis: A Bayesian Hierarchical HMM for Cis-Regulatory Module Decoding in Metazoan Genomes
The transcriptional regulatory sequences in metazoan genomes often consist of multiple cis-regulatory modules (CRMs). Each CRM contains locally enriched occurrences of binding site...
Tien-ho Lin, Pradipta Ray, Geir Kjetil Sandve, Sel...
AAAI
2006
13 years 8 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer