Nikola Jevtic

dblp:06/6902 · DBLP profile ↗
← Back
5ranked-venue papers
1as 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 · 3Graphics, computer vision, multimedia, augmented reality and games · 2Theory 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.

Artificial intelligence
2 papers
Probabilistic and Bayesian machine learning · 33% Kernel, tree and ensemble methods · 33% Learning theory · 33%

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

TopicWeightPapersLastEvidence papers
Machine learning › Learning theory › classification › multiclass classification
error-correcting output codes
0.012003
On Nearest-Neighbor Error-Correcting Output Codes with Application to All-Pairs Multiclass Support Vector Machines · J. Mach. Learn. Res. 2003
Machine learning › Probabilistic and Bayesian machine learning › structured models › latent variable model › mixture model
gaussian mixture model
0.012003
Discriminative Gaussian Mixture Models: A Comparison with Kernel Classifiers · ICML 2003
Machine learning › Kernel, tree and ensemble methods › kernel methods
kernel classifier
0.012003
Discriminative Gaussian Mixture Models: A Comparison with Kernel Classifiers · ICML 2003
Machine learning › Kernel, tree and ensemble methods
kernel methods
0.012003
Discriminative Gaussian Mixture Models: A Comparison with Kernel Classifiers · ICML 2003
Machine learning › Probabilistic and Bayesian machine learning › structured models › latent variable model
mixture model
0.012003
Discriminative Gaussian Mixture Models: A Comparison with Kernel Classifiers · ICML 2003
Machine learning › Learning theory › classification
multiclass classification
0.012003
On Nearest-Neighbor Error-Correcting Output Codes with Application to All-Pairs Multiclass Support Vector Machines · J. Mach. Learn. Res. 2003

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

support vector machine · 0.0nearest neighbor · 0.0error-correcting output codes · 0.0discriminative training · 0.0
YearPublicationVenuePosition
2005 A lower bound on compression of unknown alphabets
Nikola Jevtic, Alon Orlitsky, Narayana P. Santhanam
Theor. Comput. Sci.1
2003 Discriminative Gaussian Mixture Models: A Comparison with Kernel Classifiers
Aldebaro Klautau, Nikola Jevtic, Alon Orlitsky
ICML2
2003 On Nearest-Neighbor Error-Correcting Output Codes with Application to All-Pairs Multiclass Support Vector Machines
Aldebaro Klautau, Nikola Jevtic, Alon Orlitsky
J. Mach. Learn. Res.2
2002 Combined binary classifiers with applications to speech recognition
abstract
Many applications require classification of examples into one of several classes. A common way of designing such classifiers is to determine the class based on the outputs of several binary classifiers. We consider some of the most popular methods for combining the decisions of the binary classifiers, and improve ex-isting bounds on the error rates of the combined classifier over the training set. We also describe a new method for combining binary classifiers. The method is based on stacking a neural network and, when used with support vector machines as the binary learners, substantially decreased the error rate in two vowel classification tasks. 1.
Aldebaro Klautau, Nikola Jevtic, Alon Orlitsky
INTERSPEECH2
2000 Server-assisted speech recognition over the Internet
abstract
We propose a new architecture for deploying speech recognition over the Internet. The client performs the recognition, but is assisted by the server who computes the speech parameters. To demonstrate the architecture, we developed a Java-based Web-navigation system where the precomputed HMM models of the hyperlinked words are stored on the Web page and downloaded by the client. We tested the system on a digit-recognition example. The results show that with quantization and compression of the speech parameters, good recognition can be achieved in acceptable download and calculation time even on clients with modest connection speeds and computational powers.
Aldebaro Klautau, Nikola Jevtic, Alon Orlitsky
ICASSP2