Sciweavers

65 search results - page 4 / 13
» Predicting Query Performance via Classification
Sort
View
ICML
2005
IEEE
14 years 10 months ago
Efficient discriminative learning of Bayesian network classifier via boosted augmented naive Bayes
The use of Bayesian networks for classification problems has received significant recent attention. Although computationally efficient, the standard maximum likelihood learning me...
Yushi Jing, Vladimir Pavlovic, James M. Rehg
CHI
2008
ACM
14 years 10 months ago
Generalized selection via interactive query relaxation
Selection is a fundamental task in interactive applications, typically performed by clicking or lassoing items of interest. However, users may require more nuanced forms of select...
Jeffrey Heer, Maneesh Agrawala, Wesley Willett
ASPLOS
2006
ACM
14 years 1 months ago
Efficiently exploring architectural design spaces via predictive modeling
Architects use cycle-by-cycle simulation to evaluate design choices and understand tradeoffs and interactions among design parameters. Efficiently exploring exponential-size desig...
Engin Ipek, Sally A. McKee, Rich Caruana, Bronis R...
BMCBI
2010
224views more  BMCBI 2010»
13 years 9 months ago
An adaptive optimal ensemble classifier via bagging and rank aggregation with applications to high dimensional data
Background: Generally speaking, different classifiers tend to work well for certain types of data and conversely, it is usually not known a priori which algorithm will be optimal ...
Susmita Datta, Vasyl Pihur, Somnath Datta
WWW
2008
ACM
13 years 9 months ago
Divide, Compress and Conquer: Querying XML via Partitioned Path-Based Compressed Data Blocks
We propose a novel Partition Path-Based (PPB) grouping strategy to store compressed XML data in a stream of blocks. In addition, we employ a minimal indexing scheme called Block S...
Wilfred Ng, Ho Lam Lau, Aoying Zhou