arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1806.06232cs.LGcs.AIstat.ML
收藏

Binary Classification in Unstructured Space With Hypergraph Case-Based Reasoning

IBM Krakow Software Lab(IBM克拉科夫软件实验室);Poznań University of Technology(波兹南理工大学)

Alexandre Quemy

英文摘要:

Binary classification is one of the most common problem in machine learning. It consists in predicting whether a given element belongs to a particular class. In this paper, a new algorithm for binary classification is proposed using a hypergraph representation. The method is agnostic to data representation, can work with multiple data sources or in non-metric spaces, and accommodates with missing values. As a result, it drastically reduces the need for data preprocessing or feature engineering. Each element to be classified is partitioned according to its interactions with the training set. For each class, a seminorm over the training set partition is learnt to represent the distribution of evidence supporting this class. Empirical validation demonstrates its high potential on a wide range of well-known datasets and the results are compared to the state-of-the-art. The time complexity is given and empirically validated. Its robustness with regard to hyperparameter sensitivity is studied and compared to standard classification methods. Finally, the limitation of the model space is discussed, and some potential solutions proposed.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑