Sciweavers

3395 search results - page 505 / 679
» Learning to efficiently rank
Sort
View
ICDM
2007
IEEE
148views Data Mining» more  ICDM 2007»
15 years 9 months ago
Sample Selection for Maximal Diversity
The problem of selecting a sample subset sufficient to preserve diversity arises in many applications. One example is in the design of recombinant inbred lines (RIL) for genetic a...
Feng Pan, Adam Roberts, Leonard McMillan, David Th...
CIKM
2008
Springer
15 years 7 months ago
Fast mining of complex time-stamped events
Given a collection of complex, time-stamped events, how do we find patterns and anomalies? Events could be meetings with one or more persons with one or more agenda items at zero ...
Hanghang Tong, Yasushi Sakurai, Tina Eliassi-Rad, ...
CIKM
2008
Springer
15 years 7 months ago
Passage relevance models for genomics search
We present a passage relevance model for integrating syntactic and semantic evidence of biomedical concepts and topics using a probabilistic graphical model. Component models of t...
Jay Urbain, Ophir Frieder, Nazli Goharian
AAAI
2010
15 years 7 months ago
Stackelberg Voting Games: Computational Aspects and Paradoxes
We consider settings in which voters vote in sequence, each voter knows the votes of the earlier voters and the preferences of the later voters, and voters are strategic. This can...
Lirong Xia, Vincent Conitzer
RIAO
2004
15 years 7 months ago
Improving Ontology-Based User Profiles
Personalized Web browsing and search hope to provide Web information that matches a user's personal interests and thus provide more effective and efficient information access...
Joana Trajkova, Susan Gauch