Sciweavers

112 search results - page 11 / 23
» Anti-Serendipity: Finding Useless Documents and Similar Docu...
Sort
View
IRAL
2003
ACM
15 years 5 months ago
Extraction of user preferences from a few positive documents
In this work, we propose a new method for extracting user preferences from a few documents that might interest users. For this end, we first extract candidate terms and choose a n...
Byeong Man Kim, Qing Li, Jong-Wan Kim
KDD
2009
ACM
239views Data Mining» more  KDD 2009»
16 years 8 days ago
Applying syntactic similarity algorithms for enterprise information management
: ? Applying Syntactic Similarity Algorithms for Enterprise Information Management Ludmila Cherkasova, Kave Eshghi, Charles B. Morrey III, Joseph Tucek, Alistair Veitch HP Laborato...
Ludmila Cherkasova, Kave Eshghi, Charles B. Morrey...
OHS
2001
Springer
15 years 4 months ago
METIOREW: An Objective Oriented Content Based and Collaborative Recommending System
The size of Internet has been growing very fast and many documents appear every day in the Net. Users find many problems to obtain the information that they really need. In order t...
David Bueno, Ricardo Conejo, Amos David
CIKM
2008
Springer
15 years 1 months ago
Achieving both high precision and high recall in near-duplicate detection
To find near-duplicate documents, fingerprint-based paradigms such as Broder's shingling and Charikar's simhash algorithms have been recognized as effective approaches a...
Lian'en Huang, Lei Wang, Xiaoming Li
KDD
2007
ACM
186views Data Mining» more  KDD 2007»
16 years 3 days ago
Content-based document routing and index partitioning for scalable similarity-based searches in a large corpus
We present a document routing and index partitioning scheme for scalable similarity-based search of documents in a large corpus. We consider the case when similarity-based search ...
Deepavali Bhagwat, Kave Eshghi, Pankaj Mehra