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

Belur V. Sheela

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

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

Artificial intelligence and machine learning · 2 · 2 first-author

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
1 paper
Representation and self-supervised learning · 50% Learning paradigms · 50%
Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 2 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction › discriminant analysis
nonparametric discriminant analysis
0.011981
ANDAL: A Nonparametric Discrimination And Learning Algorithm for Recognition in Imperfectly Supervised Environments · IEEE Trans. Pattern Anal. Mach. Intell. 1981
Machine learning › Learning paradigms
partially supervised learning
0.011981
ANDAL: A Nonparametric Discrimination And Learning Algorithm for Recognition in Imperfectly Supervised Environments · IEEE Trans. Pattern Anal. Mach. Intell. 1981

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

optimal linear/nonlinear partitioning · 0.0improved flexible polyhedron method · 0.0
YearPublicationVenuePosition
1993 TEMPO - template matching by parametric optimization
Belur V. Sheela, Chandrasekar Rajagopal, K. Padmanabhan
Pattern Recognit. Lett.1
1981 ANDAL: A Nonparametric Discrimination And Learning Algorithm for Recognition in Imperfectly Supervised Environments
abstract
The problem of recognition in nonparametric environments under imperfect supervision is not amenable to solution through classical statistical approaches based on identification of finite mixtures, which require an a priori knowledge of the probabilistic descriptions of the classes. Accordingly, the problem is viewed in this study as one of optimal linear/nonlinear partitioning of the imperfectly labeled training sample set. This optimal partitioning is accomplished by defining an appropriate optimality criterion, which takes into account the imperfectness of supervision, and solving the resultant optimization problem through the Improved Flexible Polyhedron Method (IFPM). Possible alternatives to compensate for the inherent bias in this criterion towards equipopulation clusters are developed and evaluated using an illustrative example. Details of the methodology involved in implementing the approach are presented. Results of simulation experiments, which confirm the validity and effectiveness of this new technique in accomplishing optimal, linear/nonlinear discriminant learning in imperfectly supervised, nonparametric environments, are included.
Belur V. Sheela, Belur V. Dasarathy
IEEE Trans. Pattern Anal. Mach. Intell.1