Sciweavers

1599 search results - page 256 / 320
» Theoretical Frameworks for Data Mining
Sort
View
NIPS
2000
13 years 10 months ago
Active Learning for Parameter Estimation in Bayesian Networks
Bayesian networks are graphical representations of probability distributions. In virtually all of the work on learning these networks, the assumption is that we are presented with...
Simon Tong, Daphne Koller
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
14 years 9 months ago
Scalable pseudo-likelihood estimation in hybrid random fields
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
Antonino Freno, Edmondo Trentin, Marco Gori
NIPS
2003
13 years 10 months ago
Max-Margin Markov Networks
In typical classification tasks, we seek a function which assigns a label to a single object. Kernel-based approaches, such as support vector machines (SVMs), which maximize the ...
Benjamin Taskar, Carlos Guestrin, Daphne Koller
ACSC
2003
IEEE
14 years 2 months ago
A Unifying Semantic Distance Model for Determining the Similarity of Attribute Values
The relative difference between two data values is of interest in a number of application domains including temporal and spatial applications, schema versioning, data warehousing...
John F. Roddick, Kathleen Hornsby, Denise de Vries
ACMSE
2005
ACM
14 years 2 months ago
The bipartite clique: a topological paradigm for WWWeb user search customization
Web user search customization research has been fueled by the recognition that if the WWW is to attain to its optimal potential as an interactive medium the development of new and...
Brenda F. Miles, Vir V. Phoha