Sciweavers

2513 search results - page 143 / 503
» Improving Generalization by Data Categorization
Sort
View
WWW
2008
ACM
16 years 7 months ago
Temporal views over rdf data
Supporting fast access to large RDF stores has been one of key challenges for enabling use of the Semantic Web in real-life applications, more so in sensor-based systems where lar...
Craig Sayers, Geetha Manjunath, K. S. Venugopal, R...
WWW
2010
ACM
16 years 1 months ago
Sampling high-quality clicks from noisy click data
Click data captures many users’ document preferences for a query and has been shown to help significantly improve search engine ranking. However, most click data is noisy and of...
Adish Singla, Ryen W. White
SIGIR
2009
ACM
16 years 29 days ago
Smoothing clickthrough data for web search ranking
Incorporating features extracted from clickthrough data (called clickthrough features) has been demonstrated to significantly improve the performance of ranking models for Web sea...
Jianfeng Gao, Wei Yuan, Xiao Li, Kefeng Deng, Jian...
PKDD
2005
Springer
122views Data Mining» more  PKDD 2005»
15 years 12 months ago
A Probabilistic Clustering-Projection Model for Discrete Data
For discrete co-occurrence data like documents and words, calculating optimal projections and clustering are two different but related tasks. The goal of projection is to find a ...
Shipeng Yu, Kai Yu, Volker Tresp, Hans-Peter Krieg...
SC
1991
ACM
15 years 10 months ago
A method of vector processing for shared symbolic data
Kanada, Y., A method of vector processing for shared symbolic data, Parallel Computing, X (1993) XXX-XXX. Conventional processing techniques for pipelined vector processors such a...
Yasusi Kanada