Sciweavers

1804 search results - page 67 / 361
» Ranking for data repairs
Sort
View
DATAMINE
2010
133views more  DATAMINE 2010»
14 years 12 months ago
Using background knowledge to rank itemsets
Assessing the quality of discovered results is an important open problem in data mining. Such assessment is particularly vital when mining itemsets, since commonly many of the disc...
Nikolaj Tatti, Michael Mampaey
EDBT
2011
ACM
256views Database» more  EDBT 2011»
14 years 3 months ago
RanKloud: a scalable ranked query processing framework on hadoop
The popularity of batch-oriented cluster architectures like Hadoop is on the rise. These batch-based systems successfully achieve high degrees of scalability by carefully allocati...
K. Selçuk Candan, Parth Nagarkar, Mithila N...
WWW
2007
ACM
16 years 16 days ago
Measuring credibility of users in an e-learning environment
Learning Villages (LV) is an E-learning platform for people's online discussions and frequently citing postings of one another. In this paper, we propose a novel method to ra...
Wei Wei, Jimmy Ho-Man Lee, Irwin King
SIGIR
2010
ACM
15 years 3 months ago
How good is a span of terms?: exploiting proximity to improve web retrieval
Ranking search results is a fundamental problem in information retrieval. In this paper we explore whether the use of proximity and phrase information can improve web retrieval ac...
Krysta Marie Svore, Pallika H. Kanani, Nazan Khan
ELPUB
2008
ACM
15 years 1 months ago
Exploration and Evaluation of Citation Networks
This paper deals with the definitions, explanations and testing of the PageRank formula modified and adapted for bibliographic networks. Our modifications of PageRank take into ac...
Karel Jezek, Dalibor Fiala, Josef Steinberger