Sciweavers

390 search results - page 54 / 78
» Simplified similarity scoring using term ranks
Sort
View
CSFW
2010
IEEE
15 years 1 months ago
Towards Quantitative Analysis of Proofs of Authorization: Applications, Framework, and Techniques
—Although policy compliance testing is generally treated as a binary decision problem, the evidence gathered during the trust management process can actually be used to examine t...
Adam J. Lee, Ting Yu
BMCBI
2011
14 years 4 months ago
Dynamic programming re-ranking for PPI interactor and pair extraction in full-text articles
Background: Experimentally verified protein-protein interactions (PPIs) cannot be easily retrieved by researchers unless they are stored in PPI databases. The curation of such dat...
Richard Tzong-Han Tsai, Po-Ting Lai
CIKM
2008
Springer
14 years 11 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
2008
ACM
128views Data Mining» more  KDD 2008»
15 years 10 months ago
Bypass rates: reducing query abandonment using negative inferences
We introduce a new approach to analyzing click logs by examining both the documents that are clicked and those that are bypassed--documents returned higher in the ordering of the ...
Atish Das Sarma, Sreenivas Gollapudi, Samuel Ieong
CIKM
2007
Springer
15 years 4 months ago
Top-k subgraph matching query in a large graph
Recently, due to its wide applications, subgraph search has attracted a lot of attention from database and data mining community. Sub-graph search is defined as follows: given a ...
Lei Zou, Lei Chen 0002, Yansheng Lu