Advanced search
Start date
Betweenand
(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

Inductive Model Generation for Text Classification Using a Bipartite Heterogeneous Network

Full text
Author(s):
Rossi, Rafael Geraldeli [1] ; Lopes, Alneu de Andrade [1] ; Faleiros, Thiago de Paulo [1] ; Rezende, Solange Oliveira [1]
Total Authors: 4
Affiliation:
[1] Univ Sao Paulo, Inst Math & Comp Sci, Sao Carlos, SP - Brazil
Total Affiliations: 1
Document type: Journal article
Source: JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY; v. 29, n. 3, p. 361-375, MAY 2014.
Web of Science Citations: 10
Abstract

Algorithms for numeric data classification have been applied for text classification. Usually the vector space model is used to represent text collections. The characteristics of this representation such as sparsity and high dimensionality sometimes impair the quality of general-purpose classifiers. Networks can be used to represent text collections, avoiding the high sparsity and allowing to model relationships among different objects that compose a text collection. Such network-based representations can improve the quality of the classification results. One of the simplest ways to represent textual collections by a network is through a bipartite heterogeneous network, which is composed of objects that represent the documents connected to objects that represent the terms. Heterogeneous bipartite networks do not require computation of similarities or relations among the objects and can be used to model any type of text collection. Due to the advantages of representing text collections through bipartite heterogeneous networks, in this article we present a text classifier which builds a classification model using the structure of a bipartite heterogeneous network. Such an algorithm, referred to as IMBHN (Inductive Model Based on Bipartite Heterogeneous Network), induces a classification model assigning weights to objects that represent the terms for each class of the text collection. An empirical evaluation using a large amount of text collections from different domains shows that the proposed IMBHN algorithm produces significantly better results than k-NN, C4.5, SVM, and Naive Bayes algorithms. (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: 11/23689-9 - Propagation in bipartite graphs for Topic Extraction in Data Streams
Grantee:Thiago de Paulo Faleiros
Support Opportunities: Scholarships in Brazil - Doctorate
FAPESP's process: 11/19850-9 - Hierarchical clustering methods for automatic organization of search engines results
Grantee:Solange Oliveira Rezende
Support Opportunities: Regular Research Grants