Sciweavers

1662 search results - page 14 / 333
» Generation of Attributes for Learning Algorithms
Sort
View
ILP
1999
Springer
13 years 12 months ago
Probabilistic Relational Models
Most real-world data is heterogeneous and richly interconnected. Examples include the Web, hypertext, bibliometric data and social networks. In contrast, most statistical learning...
Daphne Koller
VLDB
2006
ACM
162views Database» more  VLDB 2006»
14 years 7 months ago
Dependency trees in sub-linear time and bounded memory
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
Dan Pelleg, Andrew W. Moore
JMLR
2008
83views more  JMLR 2008»
13 years 7 months ago
Generalization from Observed to Unobserved Features by Clustering
We argue that when objects are characterized by many attributes, clustering them on the basis of a random subset of these attributes can capture information on the unobserved attr...
Eyal Krupka, Naftali Tishby
KDD
1995
ACM
109views Data Mining» more  KDD 1995»
13 years 11 months ago
An Iterative Improvement Approach for the Discretization of Numeric Attributes in Bayesian Classifiers
The Bayesianclassifier is a simple approachto classification that producesresults that are easy for people to interpret. In many cases, the Bayesianclassifieris at leastasaccurate...
Michael J. Pazzani
ECIR
2003
Springer
13 years 9 months ago
Discretizing Continuous Attributes in AdaBoost for Text Categorization
Abstract. We focus on two recently proposed algorithms in the family of “boosting”-based learners for automated text classification, AdaBoost.MH and AdaBoost.MHKR . While the ...
Pio Nardiello, Fabrizio Sebastiani, Alessandro Spe...