Neighborhood hypergraph based classification algorithm for incomplete information system (Q1666460)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Neighborhood hypergraph based classification algorithm for incomplete information system |
scientific article; zbMATH DE number 6927120
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Neighborhood hypergraph based classification algorithm for incomplete information system |
scientific article; zbMATH DE number 6927120 |
Statements
Neighborhood hypergraph based classification algorithm for incomplete information system (English)
0 references
27 August 2018
0 references
Summary: The problem of classification in incomplete information system is a hot issue in intelligent information processing. Hypergraph is a new intelligent method for machine learning. However, it is hard to process the incomplete information system by the traditional hypergraph, which is due to two reasons: (1) the hyperedges are generated randomly in traditional hypergraph model; (2) the existing methods are unsuitable to deal with incomplete information system, for the sake of missing values in incomplete information system. In this paper, we propose a novel classification algorithm for incomplete information system based on hypergraph model and rough set theory. Firstly, we initialize the hypergraph. Second, we classify the training set by neighborhood hypergraph. Third, under the guidance of rough set, we replace the poor hyperedges. After that, we can obtain a good classifier. The proposed approach is tested on 15 data sets from UCI machine learning repository. Furthermore, it is compared with some existing methods, such as C4.5, SVM, NavieBayes, and \(K\)NN. The experimental results show that the proposed algorithm has better performance via Precision, Recall, AUC, and \(F\)-measure.
0 references
0 references