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

Jennifer Pittman

dblp:p/JenniferPittman · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2007
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1Theory of computation · 1

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 · 75% Learning theory · 25%
Theoretical computer science
2 papers
Mathematical optimization · 56% Information theory · 44%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference
approximate bayesian inference
0.112007
Information Conversion, Effective Samples, and Parameter Size · IEEE Trans. Inf. Theory 2007
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
bayesian inference
0.112007
Information Conversion, Effective Samples, and Parameter Size · IEEE Trans. Inf. Theory 2007
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference
bayesian model selection
0.112007
Information Conversion, Effective Samples, and Parameter Size · IEEE Trans. Inf. Theory 2007
Machine learning › Learning theory › statistical learning theory › statistical complexity
effective number of parameters
0.112007
Information Conversion, Effective Samples, and Parameter Size · IEEE Trans. Inf. Theory 2007
Information theory › information measures › divergence measures
kullback-leibler divergence
0.012007
Information Conversion, Effective Samples, and Parameter Size · IEEE Trans. Inf. Theory 2007

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

relative entropy minimization · 0.1bayesian hierarchical modeling · 0.1genetic algorithm · 0.1
YearPublicationVenuePosition
2007 Information Conversion, Effective Samples, and Parameter Size
abstract
Consider the relative entropy between a posterior density for a parameter given a sample and a second posterior density for the same parameter, based on a different model and a different data set. Then the relative entropy can be minimized over the second sample to get a virtual sample that would make the second posterior as close as possible to the first in an informational sense. If the first posterior is based on a dependent dataset and the second posterior uses an independence model, the effective inferential power of the dependent sample is transferred into the independent sample by the optimization. Examples of this optimization are presented for models with nuisance parameters, finite mixture models, and models for correlated data. Our approach is also used to choose the effective parameter size in a Bayesian hierarchical model.
Xiaodong Lin 0004, Jennifer Pittman, Bertrand S. Clarke
IEEE Trans. Inf. Theory2
2000 Fitting Optimal Piecewise Linear Functions Using Genetic Algorithms
abstract
Constructing a model for data in R/sup 2/ is a common problem in many scientific fields, including pattern recognition, computer vision, and applied mathematics. Often little is known about the process which generated the data or its statistical properties. For example, in fitting a piecewise linear model, the number of pieces, as well as the knot locations, may be unknown. Hence, the method used to build the statistical model should have few assumptions, yet, still provide a model that is optimal in some sense. Such methods can be designed through the use of genetic algorithms. We examine the use of genetic algorithms to fit piecewise linear functions to data in R/sup 2/. The number of pieces, the location of the knots, and the underlying distribution of the data are assumed to be unknown. We discuss existing methods which attempt to solve this problem and introduce a new method which employs genetic algorithms to optimize the number and location of the pieces. Experimental results are presented which demonstrate the performance of our method and compare it to the performance of several existing methods, We conclude that our method represents a valuable tool for fitting both robust and nonrobust piecewise linear functions.
Jennifer Pittman, Late C. A. Murthy
IEEE Trans. Pattern Anal. Mach. Intell.1
1998 Multilayer Perceptrons and Fractals
Late C. A. Murthy, Jennifer Pittman
Inf. Sci.2