Sciweavers

2033 search results - page 291 / 407
» Ranking on Data Manifolds
Sort
View
ICDM
2006
IEEE
139views Data Mining» more  ICDM 2006»
16 years 26 days ago
Detecting Link Spam Using Temporal Information
How to effectively protect against spam on search ranking results is an important issue for contemporary web search engines. This paper addresses the problem of combating one majo...
Guoyang Shen, Bin Gao, Tie-Yan Liu, Guang Feng, Sh...
193
Voted
VLDB
2004
ACM
98views Database» more  VLDB 2004»
16 years 5 days ago
Top-k Query Evaluation with Probabilistic Guarantees
Top-k queries based on ranking elements of multidimensional datasets are a fundamental building block for many kinds of information discovery. The best known general-purpose algor...
Martin Theobald, Gerhard Weikum, Ralf Schenkel
ICDM
2003
IEEE
92views Data Mining» more  ICDM 2003»
16 years 3 days ago
Postprocessing Decision Trees to Extract Actionable Knowledge
Most data mining algorithms and tools stop at discovered customer models, producing distribution information on customer profiles. Such techniques, when applied to industrial pro...
Qiang Yang, Jie Yin, Charles X. Ling, Tielin Chen
CAIP
2003
Springer
164views Image Analysis» more  CAIP 2003»
16 years 1 days ago
Face Recognition by Fisher and Scatter Linear Discriminant Analysis
Fisher linear discriminant analysis (FLDA) based on variance ratio is compared with scatter linear discriminant (SLDA) analysis based on determinant ratio. It is shown that each o...
Miroslaw Bober, Krzysztof Kucharski, Wladyslaw Ska...
STACS
2001
Springer
15 years 11 months ago
Approximation Algorithms for the Bottleneck Stretch Factor Problem
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
Giri Narasimhan, Michiel H. M. Smid