Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Kismat Sood

dblp:50/4609 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2005
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Probabilistic and Bayesian machine learning · 100%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › structured models › latent variable model › mixture model
dirichlet-multinomial models
0.112005
Computational aspects of Bayesian partition models · ICML 2005
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
bayesian inference
0.012004
Exact Bayesian Structure Discovery in Bayesian Networks · J. Mach. Learn. Res. 2004
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models
bayesian network
0.012004
Exact Bayesian Structure Discovery in Bayesian Networks · J. Mach. Learn. Res. 2004
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference
exact inference
0.012004
Exact Bayesian Structure Discovery in Bayesian Networks · J. Mach. Learn. Res. 2004
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models
structure learning
0.012004
Exact Bayesian Structure Discovery in Bayesian Networks · J. Mach. Learn. Res. 2004

Methods — techniques the papers use, named apart from their topics

exact integration algorithms · 0.1bayesian structure discovery · 0.0
YearPublicationVenuePosition
2005 Computational aspects of Bayesian partition models
abstract
The conditional distribution of a discrete variable y, given another discrete variable x, is often specified by assigning one multinomial distribution to each state of x. The cost of this rich parametrization is the loss of statistical power in cases where the data actually fits a model with much fewer parameters. In this paper, we consider a model that partitions the state space of x into disjoint sets, and assigns a single Dirichlet-multinomial to each set. We treat the partition as an unknown variable which is to be integrated away when the interest is in a coarser level task, e.g., variable selection or classification. Based on two different computational approaches, we present two exact algorithms for integration over partitions. Respective complexity bounds are derived in terms of detailed problem characteristics, including the size of the data and the size of the state space of x. Experiments on synthetic data demonstrate the applicability of the algorithms.
Mikko Koivisto, Kismat Sood
ICML2
2004 Exact Bayesian Structure Discovery in Bayesian Networks
Mikko Koivisto, Kismat Sood
J. Mach. Learn. Res.2