Sciweavers

2512 search results - page 194 / 503
» Learning from Highly Structured Data by Decomposition
Sort
View
DCC
2000
IEEE
15 years 8 months ago
Summary Structures for Frequency Queries on Large Transaction Sets
As large-scale databases become commonplace, there has been signi cant interest in mining them for commercial purposes. One of the basic tasks that underlies many of these mining ...
Dow-Yung Yang, Akshay Johar, Ananth Grama, Wojciec...
JMLR
2010
134views more  JMLR 2010»
14 years 11 months ago
Using Contextual Representations to Efficiently Learn Context-Free Languages
We present a polynomial update time algorithm for the inductive inference of a large class of context-free languages using the paradigm of positive data and a membership oracle. W...
Alexander Clark, Rémi Eyraud, Amaury Habrar...
ISVC
2010
Springer
15 years 2 months ago
On Supervised Human Activity Analysis for Structured Environments
We consider the problem of developing an automated visual solution for detecting human activities within industrial environments. This has been performed using an overhead view. Th...
Banafshe Arbab-Zavar, Imed Bouchrika, John N. Cart...
UAI
2003
15 years 5 months ago
Large-Sample Learning of Bayesian Networks is NP-Hard
In this paper, we provide new complexity results for algorithms that learn discrete-variable Bayesian networks from data. Our results apply whenever the learning algorithm uses a ...
David Maxwell Chickering, Christopher Meek, David ...
KDD
2002
ACM
93views Data Mining» more  KDD 2002»
16 years 4 months ago
Interactive deduplication using active learning
Deduplication is a key operation in integrating data from multiple sources. The main challenge in this task is designing a function that can resolve when a pair of records refer t...
Sunita Sarawagi, Anuradha Bhamidipaty