Exploració per autor "Domingo Soriano, Carlos"
Ara es mostren els items 1-8 de 8
-
A Role of constraint in self-organization
(1998-06)
Report de recerca
Accés obertIn this paper we introduce a neural network model of self-organization. This model uses a variation of Hebb rule for updating its synaptic weights, and surely converges to the equilibrium status. The key point of the ... -
Adaptive sampling methods for scaling up knowledge discovery algorithms
(2001-07)
Report de recerca
Accés obertOne of the biggest research challenges in KDD and Data Mining is to develop methods that scale up well to large amounts of data. A possible approach for achieving scalability is to take a random sample and do data mining ... -
Efficient read-restricted monotone CNF/DNF dualization by learning with membership queries
(1998-07-01)
Report de recerca
Accés obertWe consider exact learning monotone CNF formulas in which each variable appears at most some constant k times (``read-k'' monotone CNF). Let f: {0,1}^n ----->{0,1} be expressible as a read-k monotone CNF formula for ... -
Learning minor closed graph classes with membership and equivalence queries
(1994-10)
Report de recerca
Accés obertWe consider the problem of learning classes of graphs closed under taking minors. It is shown that any such class can be properly learned in polynomial time using membership and equivalence queries. The representation of ... -
On-line sampling methods for discovering association rules
(1999-02)
Report de recerca
Accés obertAssociation rule discovery is one of the prototypical problems in data mining. In this problem, the input database is assumed to be very large and most of the algorithms are designed to minimize the number of scans of ... -
Practical algorithms for on-line sampling
(1998-06)
Report de recerca
Accés obertOne of the core applications of machine learning to knowledge discovery consists on building a function (a hypothesis) from a given amount of data (for instance a decision tree or a neural network) such that we can use ... -
The Complexity of learning minor closed graph classes
(1995-04)
Report de recerca
Accés obertThe paper considers the problem of learning classes of graphs closed under taking minors. It is shown that any such class can be properly learned in polynomial time using membership and equivalence queries. The representation ... -
The Query complexity of learning context-free grammars
(1994-10)
Report de recerca
Accés obertIn the COLT'94 Conference A. Burago showed that the class of structurally reversible grammars is learnable in polynomial time using membership and equivalence queries. The paper shows that this class of grammars is not ...
