Sciweavers

389 search results - page 16 / 78
» Rank Selection in Multidimensional Data
Sort
View
KDD
2007
ACM
210views Data Mining» more  KDD 2007»
14 years 1 months ago
Machine learning for stock selection
In this paper, we propose a new method called Prototype Ranking (PR) designed for the stock selection problem. PR takes into account the huge size of real-world stock data and app...
Robert J. Yan, Charles X. Ling
KDD
2007
ACM
192views Data Mining» more  KDD 2007»
14 years 8 months ago
Active exploration for learning rankings from clickthrough data
We address the task of learning rankings of documents from search engine logs of user behavior. Previous work on this problem has relied on passively collected clickthrough data. ...
Filip Radlinski, Thorsten Joachims
CSB
2004
IEEE
106views Bioinformatics» more  CSB 2004»
13 years 11 months ago
A Theoretical Analysis of Gene Selection
A great deal of recent research has focused on the challenging task of selecting differentially expressed genes from microarray data (`gene selection'). Numerous gene selecti...
Sach Mukherjee, Stephen J. Roberts
VVS
1995
IEEE
132views Visualization» more  VVS 1995»
13 years 11 months ago
Multi-Dimensional Trees for Controlled Volume Rendering and Compression
This paper explores the use of multi-dimensional trees to provide spatial and temporal e ciencies in imaging large data sets. Each node of the tree contains a model of the data in...
Jane Wilhelms, Allen Van Gelder
IDEAS
2008
IEEE
105views Database» more  IDEAS 2008»
14 years 1 months ago
Pruning attribute values from data cubes with diamond dicing
Data stored in a data warehouse are inherently multidimensional, but most data-pruning techniques (such as iceberg and top-k queries) are unidimensional. However, analysts need to...
Hazel Webb, Owen Kaser, Daniel Lemire