| Full text | |
| Author(s): |
Rossi, Rafael Geraldeli
;
Lopes, Alneu de Andrade
;
Rezende, Solange Oliveira
Total Authors: 3
|
| Document type: | Journal article |
| Source: | KNOWLEDGE-BASED SYSTEMS; v. 132, p. 94-118, SEP 15 2017. |
| Web of Science Citations: | 1 |
| Abstract | |
Due to the volume of texts available in digital form, the organization, management and knowledge extraction are laborious and frequently impossible to be handled. To automatically cope with these tasks, usually classification models are generated through supervised learning techniques. Unfortunately, this type of learning usually demands a huge human effort to label large volume of texts to build accurate classification models. Since collecting unlabeled texts is easy and inexpensive in several domains, the generation of classification models through inductive semi-supervised learning has been highlighted in recent years. Inductive semi-supervised learning allows to build a classification model using labeled and unlabeled texts. In this scenario, the goal is to augment the set of labeled documents with unlabeled documents to better discriminate class patterns. Hence, fewer texts must be previously labeled. However, semi-supervised learning algorithms that consider texts represented in a vector space model usually obtain unsatisfactory classification performances and are surpassed by semi-supervised learning algorithms that consider texts represented in a network. Nevertheless, despite the classification performances, effective approaches based on networks are generated through the similarities among documents and the classification of a new document are also based on the computation of similarities. This implies to set parameters and compute similarities to both generation the networks and classification of new documents. This approach is not feasible to generate fast responses and consequently to classify a huge volume of texts. In this article, we propose an approach to induce a classification model through semi-supervised learning considering text collections represented by bipartite heterogeneous networks. Bipartite networks are easily and quickly generated, leading to classification performance equivalent or better than other approaches based on network or vector space model and allows a fast classification of new documents. The results presented in this article demonstrate that the proposed approach is able to (i) speed up semi supervised learning, (ii) speed up the classification of new documents and (iii) surpass classification performance of other existing inductive semi-supervised learning techniques. (C) 2017 Elsevier B.V. All rights reserved. (AU) | |
| FAPESP's process: | 11/12823-6 - Pattern extraction from textual document collections using heterogeneous networks |
| Grantee: | Rafael Geraldeli Rossi |
| Support Opportunities: | Scholarships in Brazil - Doctorate |
| FAPESP's process: | 14/08996-0 - Machine learning for WebSensors: algorithms and applications |
| Grantee: | Solange Oliveira Rezende |
| Support Opportunities: | Regular Research Grants |
| FAPESP's process: | 15/14228-9 - Social Network Analysis and Mining |
| Grantee: | Alneu de Andrade Lopes |
| Support Opportunities: | Regular Research Grants |