Sciweavers

1413 search results - page 85 / 283
» Efficient Learning of Semi-structured Data from Queries
Sort
View
SSDBM
2002
IEEE
149views Database» more  SSDBM 2002»
15 years 11 months ago
A Cost Model for Interval Intersection Queries on RI-Trees
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree1 ), an effi...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
TREC
2004
15 years 7 months ago
Juru at TREC 2004: Experiments with Prediction of Query Difficulty
Our experiments in the Robust track this year focused on predicting query difficulty and using this prediction for improving information retrieval. We developed two prediction alg...
Elad Yom-Tov, Shai Fine, David Carmel, Adam Darlow...
IJON
2010
112views more  IJON 2010»
15 years 3 months ago
Efficient voting prediction for pairwise multilabel classification
The pairwise approach to multilabel classification reduces the problem to learning and aggregating preference predictions among the possible labels. A key problem is the need to qu...
Eneldo Loza Mencía, Sang-Hyeun Park, Johann...
AAAI
2008
15 years 8 months ago
Instance-level Semisupervised Multiple Instance Learning
Multiple instance learning (MIL) is a branch of machine learning that attempts to learn information from bags of instances. Many real-world applications such as localized content-...
Yangqing Jia, Changshui Zhang
IPPS
1998
IEEE
15 years 10 months ago
High Performance Data Mining Using Data Cubes on Parallel Computers
On-Line Analytical Processing techniques are used for data analysis and decision support systems. The multidimensionality of the underlying data is well represented by multidimens...
Sanjay Goil, Alok N. Choudhary