Sciweavers

1489 search results - page 15 / 298
» Optimizing Feature Sets for Structured Data
Sort
View
KDD
2008
ACM
147views Data Mining» more  KDD 2008»
14 years 8 months ago
Structured learning for non-smooth ranking losses
Learning to rank from relevance judgment is an active research area. Itemwise score regression, pairwise preference satisfaction, and listwise structured learning are the major te...
Soumen Chakrabarti, Rajiv Khanna, Uma Sawant, Chir...
IEEEINTERACT
2002
IEEE
14 years 14 days ago
On the Predictability of Program Behavior Using Different Input Data Sets
Smaller input data sets such as the test and the train input sets are commonly used in simulation to estimate the impact of architecture/micro-architecture features on the perform...
Wei-Chung Hsu, Howard Chen, Pen-Chung Yew, Dong-yu...
NIPS
2003
13 years 9 months ago
Identifying Structure across Pre-partitioned Data
We propose an information-theoretic clustering approach that incorporates a pre-known partition of the data, aiming to identify common clusters that cut across the given partition...
Zvika Marx, Ido Dagan, Eli Shamir
DAS
2006
Springer
13 years 9 months ago
Extraction and Analysis of Document Examiner Features from Vector Skeletons of Grapheme 'th'
Abstract. This paper presents a study of 25 structural features extracted from samples of grapheme `th' that correspond to features commonly used by forensic document examiner...
Vladimir Pervouchine, Graham Leedham
CORR
1999
Springer
222views Education» more  CORR 1999»
13 years 7 months ago
Analysis of approximate nearest neighbor searching with clustered point sets
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
Songrit Maneewongvatana, David M. Mount