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
Demo Data from EDBT 2026 / reviewers in the wild / expert

C. Chitti Babu

dblp:66/5991 · DBLP profile ↗
← Back
6ranked-venue papers
6as first author
0since 2021 · last 1974
—ORCID · none

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

Systems, architecture and hardware · 3 · 3 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1 · 1 first-authorTheory of computation · 1 · 1 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.

Theoretical computer science
3 papers
Information theory · 52% Computational geometry · 26% Algorithms and data structures · 22%
Databases, data mining, and information retrieval
2 papers
Data mining · 100%

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

TopicWeightPapersLastEvidence papers
Data mining › dimensionality reduction
feature selection		 0.011972
On the Extraction of Pattern Features from Imperfectly Identified Samples · IEEE Trans. Computers 1972
Data mining
pattern recognition		 0.011972
On the Extraction of Pattern Features from Imperfectly Identified Samples · IEEE Trans. Computers 1972
Information theory › information measures › divergence measures
bhattacharyya coefficient		 0.011972
On the Extraction of Pattern Features from Imperfectly Identified Samples · IEEE Trans. Computers 1972
Computational geometry
distance measures		 0.011972
On the distance criterion of Patrick and Fischer (Corresp.) · IEEE Trans. Inf. Theory 1972
Information theory › statistical inference
statistical decision theory		 0.011972
On the distance criterion of Patrick and Fischer (Corresp.) · IEEE Trans. Inf. Theory 1972
Data mining › predictive modeling › classification
pattern classification		 0.011971
An Algorithm for Pattern Classification Using Eigenvectors · IEEE Trans. Computers 1971
Algorithms and data structures › numerical linear algebra
eigenvalue computation		 0.011971
An Algorithm for Pattern Classification Using Eigenvectors · IEEE Trans. Computers 1971

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

upper bounding · 0.0
YearPublicationVenuePosition
1974 Author's Reply
abstract
I thank Dr. Toussaint for his interest in my work. To answer his first point namely the validity of the upperbound, over the range of β, a better bound appears in another paper ([1, (10)]).
C. Chitti Babu
 IEEE Trans. Computers1
1973 On feature extraction in pattern recognition
C. Chitti Babu
 Inf. Sci.1
1973 Correction to "On the Application of Divergence for the Extraction of Features from Imperfectly Labeled Patterns"
C. Chitti Babu
 IEEE Trans. Syst. Man Cybern.1
1972 On the Extraction of Pattern Features from Imperfectly Identified Samples
abstract
The application of Bhattacharyya coefficient for the selection of effective features from imperfectly labeled patterns is examined.
C. Chitti Babu
 IEEE Trans. Computers1
1972 On the distance criterion of Patrick and Fischer (Corresp.)
abstract
An upper bound on the probability of misrecognition is obtained in terms of Patrick and Fischer's measure of distance and its maximization is shown to minimize the upper bound on the probability of error.
C. Chitti Babu
 IEEE Trans. Inf. Theory1
1971 An Algorithm for Pattern Classification Using Eigenvectors
abstract
An algorithm for pattern classification using eigenvectors is presented. This algorithm provides an alternative viewpoint for obtaining a solution weight vector of certain pattern classification problems. Convergence of the algorithm is proved and the termination condition of iteration is given. An interesting point is that this algorithm does not require the inversion of matrices, instead it requires the computation of eigenvalues and eigenvectors of the matrix.
C. Chitti Babu, Wah-Chun Chan
 IEEE Trans. Computers1