Sciweavers

684 search results - page 80 / 137
» Elimination of Redundant Information for Web Data Mining
Sort
View
KDD
2007
ACM
190views Data Mining» more  KDD 2007»
14 years 8 months ago
Model-shared subspace boosting for multi-label classification
Typical approaches to multi-label classification problem require learning an independent classifier for every label from all the examples and features. This can become a computati...
Rong Yan, Jelena Tesic, John R. Smith
KDD
2004
ACM
213views Data Mining» more  KDD 2004»
14 years 1 months ago
Analytical view of business data
This paper describes a logical extension to Microsoft Business Framework (MBF) called Analytical View (AV). AV consists of three components: Model Service for design time, Busines...
Adam Yeh, Jonathan Tang, Youxuan Jin, Sam Skrivan
WWW
2010
ACM
14 years 2 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
AAAI
2008
13 years 10 months ago
Automatic Extraction of Data Points and Text Blocks from 2-Dimensional Plots in Digital Documents
Two dimensional plots (2-D) in digital documents on the web are an important source of information that is largely under-utilized. In this paper, we outline how data and text can ...
Saurabh Kataria, William Browuer, Prasenjit Mitra,...
PLDI
1990
ACM
13 years 11 months ago
A Fresh Look at Optimizing Array Bound Checking
- This paper describes techniques for optimizing range checks performed to detect array bound violations. In addition to the elimination of range check:s, the optimizations discuss...
Rajiv Gupta