Convex sets as prototypes for classifying patterns-Reference-Cited by-同舟云学术

Convex sets as prototypes for classifying patterns

Published:2009-02 Issue:1 Volume:22 Page:101-108
ISSN:0952-1976
Container-title:Engineering Applications of Artificial Intelligence
language:en
Short-container-title:Engineering Applications of Artificial Intelligence

Author:

Takigawa Ichigaku,Kudo Mineichi,Nakamura Atsuyoshi

Publisher

Elsevier BV

Subject

Electrical and Electronic Engineering,Artificial Intelligence,Control and Systems Engineering

Reference30 articles.

1. Spanned patterns for the logical analysis of data;Alexe;Discrete Applied Mathematics,2006

2. Bennett, K.P., Bredensteiner, E.J., 2000. Duality and geometry in SVM classifiers. In: ICML’00: Proceedings of the 17th International Conference on Machine Learning, San Francisco, CA, USA. Morgan Kaufmann, Los Altos, CA, pp. 57–64.

3. Pattern Recognition and Machine Learning (Information Science and Statistics);Bishop,2006

4. Blake, C., Merz, C., 1998. UCI repository of machine learning databases.

5. Minimum distance to the complement of a convex set: Duality result;Briec;Journal of Optimization Theory and Applications,1997

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Interpretable Counterfactual Explanations Guided by Prototypes;Machine Learning and Knowledge Discovery in Databases. Research Track;2021

2. Margin setting algorithm for pattern classification via spheres;Pattern Analysis and Applications;2020-06-15

3. Classification using proximity catch digraphs;Machine Learning;2020-03-31

4. Categories in emergency decision-making: prototype-based classification;Kybernetes;2019-06-24

5. Prototype-based classification and error analysis under bootstrapping strategy;International Journal of Data Mining, Modelling and Management;2018