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

Moshe Ben-Bassat

dblp:41/407 · DBLP profile ↗
← Back
20ranked-venue papers
15as first author
0since 2021 · last 1998
—ORCID · none

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

Artificial intelligence and machine learning · 9 · 6 first-authorSystems, architecture and hardware · 5 · 4 first-authorGraphics, computer vision, multimedia, augmented reality and games · 3Theory of computation · 3 · 3 first-authorHuman-computer interaction and ubiquitous computing · 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
10 papers
3D vision · 57% Probabilistic and Bayesian machine learning · 15% Knowledge representation and reasoning · 7%
Theoretical computer science
4 papers
Information theory · 52% Coding theory · 26% Mathematical optimization · 13%
Interdisciplinary, comprehensive, and emerging computing
2 papers
Medical and health informatics · 100%

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

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision
3d object recognition
0.011996
FEG structures for representation and recognition of 3-D polyhedral objects · Int. J. Comput. Vis. 1996
Computer vision › 3D vision › 3d object recognition
polyhedral object recognition
0.011996
FEG structures for representation and recognition of 3-D polyhedral objects · Int. J. Comput. Vis. 1996
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference
bayesian classification
0.051983
Evaluating Multimembership Classifiers: A Methodology and Application to the MEDAS Diagnostic System · IEEE Trans. Pattern Anal. Mach. Intell. 1983
Sensitivity Analysis in Bayesian Classification Models: Multiplicative Deviations · IEEE Trans. Pattern Anal. Mach. Intell. 1980
Irrelevant Features in Pattern Recognition · IEEE Trans. Computers 1978
Computer vision › 3D vision
object representation
0.011996
FEG structures for representation and recognition of 3-D polyhedral objects · Int. J. Comput. Vis. 1996
Knowledge, reasoning and agents › Knowledge representation and reasoning
expert systems
0.011987
CAMEX - An Expert System for Process Planning on CNC Machines · AAAI 1987
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › planning
process planning
0.011987
CAMEX - An Expert System for Process Planning on CNC Machines · AAAI 1987
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction
feature selection
0.041980
On the Sensitivity of the Probability of Error Rule for Feature Selection · IEEE Trans. Pattern Anal. Mach. Intell. 1980
Irrelevant Features in Pattern Recognition · IEEE Trans. Computers 1978
Myopic Policies in Sequential Classification · IEEE Trans. Computers 1978
Computer vision › Image recognition and object detection
template matching
0.011984
Contextual Template Matching: A Distance Measure for Patterns with Hierarchically Dependent Features · IEEE Trans. Pattern Anal. Mach. Intell. 1984
Machine learning › Probabilistic and Bayesian machine learning › structured prediction
sequential classification
0.021978
Myopic Policies in Sequential Classification · IEEE Trans. Computers 1978
Irrelevant Features in Pattern Recognition · IEEE Trans. Computers 1978
Coding theory › channel coding
error probability bounds
0.021978
Renyi's entropy and the probability of error · IEEE Trans. Inf. Theory 1978
Epsilon -equivalence of feature selection rules (Corresp.) · IEEE Trans. Inf. Theory 1978
Medical and health informatics
clinical decision support
0.021983
Pattern-Based Interactive Diagnosis of Multiple Disorders: The MEDAS System · IEEE Trans. Pattern Anal. Mach. Intell. 1980
Evaluating Multimembership Classifiers: A Methodology and Application to the MEDAS Diagnostic System · IEEE Trans. Pattern Anal. Mach. Intell. 1983
Machine learning › Trustworthy machine learning › interpretability
sensitivity analysis
0.011980
Sensitivity Analysis in Bayesian Classification Models: Multiplicative Deviations · IEEE Trans. Pattern Anal. Mach. Intell. 1980
Information theory › information measures › entropy
entropy bounds
0.011978
Renyi's entropy and the probability of error · IEEE Trans. Inf. Theory 1978
Information theory › information measures › entropy
entropy measures
0.011978
Renyi's entropy and the probability of error · IEEE Trans. Inf. Theory 1978
Mathematical optimization › sparse learning
feature selection
0.011978
Epsilon -equivalence of feature selection rules (Corresp.) · IEEE Trans. Inf. Theory 1978
Information theory › information measures › entropy › generalized entropy
rényi entropy
0.011978
Renyi's entropy and the probability of error · IEEE Trans. Inf. Theory 1978
Computational geometry
distance measures
0.011984
Contextual Template Matching: A Distance Measure for Patterns with Hierarchically Dependent Features · IEEE Trans. Pattern Anal. Mach. Intell. 1984

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

conditional pattern space · 0.0bayesian pattern recognition · 0.0knowledge-based reasoning · 0.0tie-breaking rule · 0.0multiplicative deviation analysis · 0.0shannon's equivocation rule · 0.0renyi entropy · 0.0quadratic equivocation rule · 0.0myopic policy · 0.0feature selection · 0.0conditional probability computation · 0.0concavity analysis · 0.0bhattacharyya rule · 0.0bayesian modeling · 0.0
YearPublicationVenuePosition
1998 Can model-based and case-based expert systems operate together?
abstract
There is an ongoing debate as to whether model-based or case-based diagnostic expert systems are superior. Our experience has shown that the two are not mutually exclusive and, to the contrary, complement each other. Current expert system technology is capable of two reasoning mechanisms, in addition to other mechanisms, integrated into one system. Depending on the knowledge available, and time and cost considerations, expert systems allow the user to decide the relative proportion of case-based to model-based reasoning to employ in any given situation. Diagnostic support software should be evaluated by two critical factor groups: (a) cost and time to deployment, and (b) accuracy, completeness and efficiency of the diagnostic process. In this paper we will discuss the role of expert systems in combining model-based and case-based reasoning to effect the most efficient user defined solution to diagnostic performance.
Moshe Ben-Bassat, Israel Beniaminy, David Joseph
ITC1
1996 FEG structures for representation and recognition of 3-D polyhedral objects
Ilan Schreiber, Moshe Ben-Bassat
Int. J. Comput. Vis.2
1993 Experience in Diagnosing a Remote, Tele-Controlled Unit Using the AITEST Expert System
abstract
This paper describes our experience in using a diagnostic expert system (AITEST) for fault isolation, diagnosis and repair action recommendations for a remote, tele-controlled UUT (Unit Under Test). We identify the unique requirements of diagnosis in this class of problems, and explains how these requirements were met in less than three person-months by integrating the expert system with specially-developed tele-control software and test software to form a seamless and capable diagnostic system for a specific UUT. We describe the process we used in analyzing the problem, concurrent development of knowledge base and test software, and their integration into the complete solution. We conclude by presenting preliminary results.>
Israel Beniaminy, Moshe Ben-Bassat, M. Bodenheimer, M. Eshel
ITC2
1990 Polygonal object recognition
abstract
A technique for recognizing a 2-D unoccluded polygonal object by combining the alignment method with efficient string matching algorithms is presented. The approach is based on a single anchor point: the gravitation center of the contour (GCC) of the object. The GCC is stable and insensitive to digitization errors, and it can always be found and calculated very efficiently. Additionally, it is universal and does not depend on the specific library of known objects. In this approach, most of the work is done in the preprocessing stage, when all of the library objects are transformed into a GCC canonical representation form. For the recognition stage, the canonical representation of the unknown object concatenated to itself is considered as a 'text' and the canonical representation of the known library objects as a set of 'words'. The recognition problem is then reduced to finding all of the occurrences of the 'words' in the 'text', for which an efficient O(n) algorithm is introduced, where n is the order of the polygon being recognized. This approach was evaluated with several sets of objects from different fields, and very satisfactory results were obtained.>
Ilan Schreiber, Moshe Ben-Bassat
ICPR (1)2
1989 A Proposed Benchmark Unit for Evaluating Electronic Troubleshooting Expert Systems
abstract
In order to establish a uniform basis for comparing and evaluating diagnostic expert systems for functional electronic troubleshooting, a real-life benchmark unit is proposed. The HP-3478P unit is essentially identical to the HP-3478A digital multimeter. The authors first outline the criteria that guided them in the selection of this unit from a wide variety of real-life units. They describe the structure of the HP-3478P and its test set. They then provide an illustrative test case and a discussion of the complexity of the unit. The HP-3478P was used to evaluate the AITEST system on a wide variety of cases, and it was found to be very useful.>
Moshe Ben-Bassat, Defna Ben-Arie, Israel Beniaminy, Jonathan Cheifetz, Michael Klinger
ITC1
1987 CAMEX - An Expert System for Process Planning on CNC Machines
O. Eliyahu, Lev Zaidenberg, Moshe Ben-Bassat
AAAI3
1984 Contextual Template Matching: A Distance Measure for Patterns with Hierarchically Dependent Features
abstract
Contextual template matching refers to situations where the feature sets of the two templates under consideration may not be identical, but are rather contingent on the context within which these templates are observed. This paper addresses context-dependent template matching where the relevancy of certain features to a given object is contingent on the value of higher level features. In such situations portions of the patterns for two objects X and Y may not be comparable, and therefore classical distance measures are not applicable. A framework for describing pattern spaces with hierarchically dependent features-named conditional pattern spaces (CPS)-is presented, and a distance measure for comparing objects in a CPS is developed and illustrated on archaeological objects. This measure satisfies several desired properties of distance measures, such as the metric requirements.
Moshe Ben-Bassat, Lev Zaidenberg
IEEE Trans. Pattern Anal. Mach. Intell.1
1984 Human-oriented information acquisition in sequential pattern classification: Part I - Single membership classification
abstract
Information acquisition strategies which incorporate human heuristics are formulated for pattern classification tasks, and their effectiveness is evaluated. The heuristics are based on two observations: (1) human decision-makers tend to limit themselves to a subset of classes and to select features oriented toward this subject only; (2) human decision-makers typically use considerations related to the history of process, that is, to class probabilities in earlier stages, while classical Bayesian strategies consider only the current class probabilities. These heuristics are incorporated in four different strategies with which the authors experimented. The findings are useful for the development of decision aids whose information selection strategies may be tuned to the operator's information selection behaviour by offering the operator an aid which reflects his own information priorities.
Moshe Ben-Bassat, Dov Te'eni
IEEE Trans. Syst. Man Cybern.1
1983 Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition
Dov Dori, Moshe Ben-Bassat
Comput. Vis. Graph. Image Process.2
1983 Evaluating Multimembership Classifiers: A Methodology and Application to the MEDAS Diagnostic System
abstract
Performance evaluation measures for multimembership classifiers are presented and applied in a retrospective study on the diagnostic performance of the MEDAS (Medical Emergency Decision Assistance System) system. Admission and discharge diagnoses for 122 patients with one or more of 26 distinct disorders in five major disorder categories were gathered. The average number of disorders per patient was 2 with 36 (29.5 percent) patients having 3 or more disorders simultaneously. The features (symptoms, signs, and laboratory data) available at admission were entered into a multimembership Bayesian pattern recognition algorithm which permits for diagnosis of multiple disorders. When the top five computer-ranked diagnoses were considered, all of the correct diagnoses for 86.1 percent of the patients were displayed by the fifth position. In 71.6 percent of these cases, no false diagnosis preceded any correct diagnosis. In ten cases a discharge diagnosis which was suggested by the available findings was omitted by the admitting physician. In six of these ten cases, the overlooked diagnoses appeared at the computer ranked list above all false diagnoses. Considering the urgency of diagnosis in the Emergency Department, the high uncertainty involved due to the limited availability of data, and the high frequency with which multiple disorders coexist, this limited study encourages our confidence in the MEDAS knowledge base and algorithm as a useful diagnostic support tool.
Moshe Ben-Bassat, David B. Campell, Arthur R. Macneil, Max Harry Weil
IEEE Trans. Pattern Anal. Mach. Intell.1
1982 Knowledge Requirements and Management in Expert Decision Support Systems for (Military) Situation Assessment
abstract
Situation assessment tasks, e.g., medical diagnosis, battlefield reading, corporation status assessment for merger or acquisition purposes, are formulated as a general family of problem solving tasks. The generic nature of this family task as a multimembership hierarchical pattern recognition problem is characterized and the types of decision support systems (DSS) are identified. The focus is on knowledge representation and elicitation, although issues related to inference mechanisms, system structure, and expert-machine-user interface are also discussed. Two types of knowledge are distinguished: global knowledge and local knowledge. Global knowledge is required to determine directions on which to focus attention, while local knowledge is required for assessing the validity of a specific alternative based on a given set of findings. Global knowledge is represented as a network of relevancy pointers between alternatives and features. Attached to the links of this network are weights by which the strength of relevancy is evaluated and global directions (hypotheses) for situation analysis are determined. For local knowledge, it seems that in most practical problems multiple representation techniques would be required to characterize adequately the alternatives by means of their relevant features. The presentation is accompanied by examples for military situation assessment. However, comparable examples from medical and business applications are also cited. In fact, many of the ideas presented here have already been implemented in the MEDAS system-a medical DSS for emergency and critical care medicine.
Moshe Ben-Bassat, Amos Freedy
IEEE Trans. Syst. Man Cybern.1
1980 On the Sensitivity of the Probability of Error Rule for Feature Selection
abstract
The low sensitivity of the probability of error rule (Pe rule) for feature selection is demonstrated and discussed. It is shown that under certain conditions features with significantly different discrimination power are considered as equivalent by the Pe rule. The main reason for this phenomenon lies in the fact that, directly, the Pe rule depends only on the most probable class and that, under the stated condition, the prior most probable class remains the posterior most probable class regardless of the result for the observed feature. A rule for breaking ties is suggested to refine the feature ordering induced by the Pe rule. By this tie-breaking rule, when two features have the same value for the expected probability of error, the feature with the higher variance for the probability of error is preferred.
Moshe Ben-Bassat
IEEE Trans. Pattern Anal. Mach. Intell.1
1980 Pattern-Based Interactive Diagnosis of Multiple Disorders: The MEDAS System
abstract
A knowledge-based interactive sequential diagnostic system is introduced which provides for diagnosis of multiple disorders in several body systems. The knowledge base consists of disorder patterns in a hierarchical structure that constitute the background medical information required for diagnosis in the domain under consideration (emergency and critical care medicine, in our case). Utilizing this knowledge base, the diagnostic process is driven by a multimembership classification algorithm for diagnostic assessment as well as for information acquisition [1]. A key characteristic of the system is congenial man-machine interface which comes to expression in, for instance, the flexibility it offers to the user in controlling its operation. At any stage of the diagnostic process the user may decide on an operation strategy that varies from full user control, through mixed initiative to full system control. Likewise, the system is capable of explaining to the user the reasoning process for its decisions. The model is independent of the knowledge base, thereby permitting continuous update of the knowledge base, as well as expansions to include disorders from other disciplines. The information structure lends itself to compact storage and provides for efflcient computation. Presently, the system contains 53 high-level disorders which are diagnosed by means of 587 medical findings.
Moshe Ben-Bassat, Richard W. Carlson, Venod K. Puri, Mark D. Davenport, John A. Schriver, Mohamed Latif, Ronald Smith, Larry D. Portigal, Edward H. Lipnick, Max Harry Weil
IEEE Trans. Pattern Anal. Mach. Intell.1
1980 Sensitivity Analysis in Bayesian Classification Models: Multiplicative Deviations
abstract
The sensitivity of Bayesian pattern recognition models to multiplicative deviations in the prior and conditional probabilities is investigated for the two-class case. Explicit formulas are obtained for the factor K by which the computed posterior probabilities should be divided in order to eliminate the deviation effect. Numerical results for the case of binary features indicate that the Bayesian model tolerates large deviations in the prior and conditional probabilities. In fact, the a priori ratio and the likelihood ratio may deviate within a range of 65-135 percent and still produce posterior probabilities in accurate proximity of at most ±0.10. The main implication is that Bayesian systems which are based on limited data or subjective probabilities are expected to have a high percentage of correct classification despite the fact that the prior and conditional probabilities they use may deviate rather significantly from the true values.
Moshe Ben-Bassat, Karin L. Klove, Max Harry Weil
IEEE Trans. Pattern Anal. Mach. Intell.1
1978 f-Entropies, probability of Error, and Feature Selection
Moshe Ben-Bassat
Inf. Control.1
1978 Irrelevant Features in Pattern Recognition
abstract
The concept of irrelevant features in Bayesian models for pattern recognition is introduced, and its mathematical meaning is explained. A technique for computing the conditional probabilities of irrelevant features, if necessary, is described. The effect of irrelevant features on feature selection in sequential classification is discussed and illustrated.
Moshe Ben-Bassat
IEEE Trans. Computers1
1978 Myopic Policies in Sequential Classification
abstract
Several rules for feature selection in myopic policy are examined for solving the sequential finite classification problem with conditionally independent binary features. The main finding is that no rule is consistently superior to the others. Likewise no specific strategy for the alternating of rules seems to be significantly more efficient.
Moshe Ben-Bassat
IEEE Trans. Computers1
1978 Epsilon -equivalence of feature selection rules (Corresp.)
abstract
The ranking of features according to a feature selection criteria is examined. The concept of\epsilon-equivalence is introduced to measure the extent to which a ranking deviates from the ranking included by the probability of error role. The relationship between the\epsilon-equivalence of a given role and the bounds on the probability of error derived from this rule is demonstrated. Illustrations of the\epsilon-equivalence concept are presented for Shannon's equivocation rule, the quadratic equivocation rule, and the Bhattacharyya rule. A numerical example concludes the presentation.
Moshe Ben-Bassat
IEEE Trans. Inf. Theory1
1978 Renyi's entropy and the probability of error
abstract
The basic properties of Renyi's entropy are reviewed, and its concavity properties are characterized. New bounds (referred to asI_{\alpha}bounds) on the probability of error are derived from Renyi's entropy and are compared with known bounds. It is proved that for the two-class case, theI_{2}bound is sharper than many of the previously known bounds. The difference between theI_{2}bound and the real value of the probability of error is at most 0.09.
Moshe Ben-Bassat, Josef Raviv
IEEE Trans. Inf. Theory1
1977 Properties and convergence of a posteriori probabilities in classification problems
Moshe Ben-Bassat, Shmuel Gal
Pattern Recognit.1