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

Victor L. Brailovsky

dblp:97/3050 · also Viktor L. Brailovsky · DBLP profile ↗
← Back
15ranked-venue papers
11as first author
0since 2021 · last 1999
—ORCID · none

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

Artificial intelligence and machine learning · 15 · 11 first-authorGraphics, computer vision, multimedia, augmented reality and games · 4 · 4 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
1 paper
Mathematical optimization · 100%
Artificial intelligence
2 papers
Learning theory · 33% Representation and self-supervised learning · 33% Knowledge representation and reasoning · 33%

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

TopicWeightPapersLastEvidence papers
Mathematical optimization › sparse learning
feature selection
0.011988
On use of predictive probabilistic estimates for selecting best decision rules in the course of a search · CVPR 1988
Machine learning › Learning theory
classification
0.011981
On the Influence of Sample Set Structure on Decision Rule Quality for the Case of a Linear Discriminant Function · IEEE Trans. Pattern Anal. Mach. Intell. 1981
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction › discriminant analysis
linear discriminant analysis
0.011981
On the Influence of Sample Set Structure on Decision Rule Quality for the Case of a Linear Discriminant Function · IEEE Trans. Pattern Anal. Mach. Intell. 1981
Knowledge, reasoning and agents › Knowledge representation and reasoning › rule learning
rule quality estimation
0.011981
On the Influence of Sample Set Structure on Decision Rule Quality for the Case of a Linear Discriminant Function · IEEE Trans. Pattern Anal. Mach. Intell. 1981
Mathematical optimization › heuristic optimization
search-based optimization
0.011988
On use of predictive probabilistic estimates for selecting best decision rules in the course of a search · CVPR 1988

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

predictive probabilistic estimate · 0.0monte carlo estimation · 0.0statistical simulation · 0.0multivariate normal modeling · 0.0
YearPublicationVenuePosition
1999 On domain knowledge and feature selection using a support vector machine
Ofir Barzilay, Victor L. Brailovsky
Pattern Recognit. Lett.2
1999 On global, local, mixed and neighborhood kernels for support vector machines
Victor L. Brailovsky, Ofir Barzilay, Rabin Shahave
Pattern Recognit. Lett.1
1999 Fast and robust techniques for detecting straight line segments using local models
Ron Shpilman, Victor L. Brailovsky
Pattern Recognit. Lett.2
1998 A reinforced random algorithm for a partial contour perceptual similarity problem
Konstantin Y. Kupeev, Victor L. Brailovsky
Pattern Recognit. Lett.2
1997 An approach to form recognition based on non-linear projections, search and optimization
Victor L. Brailovsky
Pattern Recognit. Lett.1
1996 An approach to outlier detection based on Bayesian probabilistic model
abstract
The problem of outlier detection is considered with reference to a piecewise-smooth signal corrupted by background Gaussian noise plus spikes. The problem of estimating the variance of background noise is considered and a robust algorithm which solves the problem in such an environment is suggested. The estimate of variance is essential for an outlier detection algorithm as well as for different algorithms for signal (image) analysis. Our approach to outlier detection is based on a Bayesian probabilistic model. The model enables selection of a set of informative tests for outlier detection. An experimental algorithm based on this approach is tested and its comparison with the median based approach is presented.
Victor L. Brailovsky
ICPR1
1995 Probabilistic validation approach for clustering
Michael Har-Even, Victor L. Brailovsky
Pattern Recognit. Lett.2
1992 On vector piece-wise regression and clustering
abstract
The paper addresses the problem of discovering a piecewise-smooth structure of vector response function corrupted by heavy noise. The solution is obtained by dynamic programming algorithm in combination with a probabilistic estimate. The comparison with the approach based on clustering technique, is discussed.>
Victor L. Brailovsky
ICPR (3)1
1992 Application of piece-wise regression to detecting internal structure of signal
Victor L. Brailovsky, Yulia Kempner
Pattern Recognit.1
1992 Vector piece-wise regression versus clustering (definition and comparative analysis)
Victor L. Brailovsky
Pattern Recognit. Lett.1
1991 A probabilistic approach to clustering
Victor L. Brailovsky
Pattern Recognit. Lett.1
1990 A probabilistic estimate of clustering
abstract
The concept of probabilistic estimate of clustering (PEC) is introduced. It is based on the examination of an ensemble of clustering problems, in addition to the one given, and the estimation of the probability of obtaining clustering of better quality than that achieved for the given problem. Some properties of PEC and experimental results are presented.>
Victor L. Brailovsky
ICPR (1)1
1988 On use of predictive probabilistic estimates for selecting best decision rules in the course of a search
abstract
The problem of how to find the 'best' decision rule in the course of a search with the help of analysis of sample set is considered. Specifically the problem of selecting of best subset of regressors is highlighted. The concepts of predictive probabilistic estimate (PPE), decomposition of a search process on stages, ensemble of noise functions and reference probability distribution on it are introduced and discussed. A Monte Carlo procedure for estimating PPE is suggested and applied to a practical example. A method of obtaining upper and lower bounds for the PPE is suggested.>
Victor L. Brailovsky
CVPR1
1981 On the Influence of Sample Set Structure on Decision Rule Quality for the Case of a Linear Discriminant Function
abstract
The influence of sample set structure on decision rule quality for the case of a linear discriminant function is considered. Specifically, the case of missing data in the sample set and the case when the multivariate random variable is to be registered with the help of a single-channel device are investigated. Some rather unusual phenomena are discussed, such as when some new samples are added to the sample set, and as a result the quality of parameter estimations used in a decision rule become better, but at the same time the quality of the decision rule itself becomes worse. The investigation is performed for the classical model of a twocategory classifier when the categories are described by the multivariate normal densities having common covariance matrices. Some results of statistical simulation experiments are included.
Victor L. Brailovsky
IEEE Trans. Pattern Anal. Mach. Intell.1
1979 Some procedures for function approximation based on the use of sample data and their application in heuristic methods for solving practical problems
Victor L. Brailovsky
Pattern Recognit.1