# An Innovative Graph-Based Approach to Advance Feature Selection from Multiple Textual Documents

Nikolaos Giarelis, Nikos Kanakaris, Nikos Karacapilidis

► To cite this version:

Nikolaos Giarelis, Nikos Kanakaris, Nikos Karacapilidis. An Innovative Graph-Based Approach to Advance Feature Selection from Multiple Textual Documents. Ilias Maglogiannis; Lazaros Iliadis; Elias Pimenidis. Artificial Intelligence Applications and Innovations: 16th IFIP WG 12.5 International Conference, AIAI 2020, Neos Marmaras, Greece, June 5-7, 2020, Proceedings, Part I, AICT-583 (Part I), Springer International Publishing, pp.96-106, 2020, IFIP Advances in Information and Communication Technology, 978-3-030-49160-4. 10.1007/978-3-030-49161-1_9. hal-04050583

HAL Id: hal-04050583

https://inria.hal.science/hal-04050583

Submitted on 29 Mar 2023

HAL is a multi-disciplinary open access
archive for the deposit and dissemination of sci-
entific research documents, whether they are pub-
lished or not. The documents may come from
teaching and research institutions in France or
abroad, or from public or private research centers.

L'archive ouverte pluridisciplinaire HAL, est
destinée au dépôt et à la diffusion de documents
scientifiques de niveau recherche, publiés ou non,
émanant des établissements d'enseignement et de
recherche français ou étrangers, des laboratoires
publics ou privés.

<figure><img src="image_1.png" /></figure>
# An innovative graph-based approach to advance feature selection from multiple textual documents

Nikolaos Giarelis [0000-0003-2611-3129], Nikos Kanakaris [0000-0001-9352-5807] and

Nikos Karacapilidis [0000-0002-6581-6831]

Industrial Management and Information Systems Lab, MEAD
University of Patras, 26504 Rio Patras, Greece
giarelis@ceid.upatras.gr, nkanakaris@upnet.gr,
karacap@upatras.gr

**Abstract.** This paper introduces a novel graph-based approach to select features from multiple textual documents. The proposed solution enables the investigation of the importance of a term into a whole corpus of documents by utilizing contemporary graph theory methods, such as community detection algorithms and node centrality measures. Compared to well-tried existing solutions, evaluation results show that the proposed approach increases the accuracy of most text classifiers employed and decreases the number of features required to achieve ‘state-of-the-art’ accuracy. Well-known datasets used for the experiments reported in this paper include 20Newsgroups, LingSpam, Amazon Reviews and Reuters.

**Keywords:** Feature Selection, Graph-based Text Representation, Document Clustering, Text Mining, Natural Language Processing.

## 1 Introduction

Graph-based text representations are widely used in various Natural Language Processing, Text Mining and Information Retrieval tasks (Vazirgiannis et al., 2018). These representations exploit concepts and techniques inherited from graph theory (e.g. node centrality and subgraph frequency) to address limitations of the classical *bag-of-words* representation (Aggarwal, 2018); in this way, they are able to capture structural and semantic information of a text, mitigate the effects of the ‘curse-of-dimensionality’ phenomenon, identify the most important terms of a text, and seamlessly incorporate information coming from external knowledge sources. However, existing graph-based representations concern a single document each time. In cases where one needs to analyze a corpus of documents, these approaches demonstrate a series of weaknesses, the main of them being that they are incapable to assess the importance of a word for the whole set of documents.

Recently, graph-based text representations have been used to facilitate and augment the feature selection process, i.e. the process of selecting a subset of relevant features when constructing a model. These approaches combine statistical tests and
graph algorithms to uncover hidden correlations between terms and document classes. However, while they take into account the co-occurrences between terms to identify the most representative features of a single document (something that is not the case in traditional statistical methods), they are not able to assess the importance of a term in a corpus of documents. To remedy the above weakness, this paper builds on a graph-based text representation model to introduce a novel approach to feature selection from multiple textual documents, namely *GraFS*. Contrary to existing approaches, the one introduced in this paper (i) enables the investigation of the importance of a term into a whole corpus of documents, (ii) incorporates the relationships between terms (co-occurrences) into the feature selection process, (iii) achieves state-of-the-art accuracy in ML tasks such as text classification using fewer features, and (iv) mitigates the effects of the ‘curse-of-dimensionality’ phenomenon. GraFS has been evaluated by using five datasets and five classifiers. Compared to four well-tried existing feature selection approaches, our initial experimental results show that GraFS increases the accuracy of most text classifiers and decreases the number of features required to achieve ‘state-of-the-art’ accuracy.

The remainder of the paper is organized as follows. Section 2 discusses related work issues. The proposed feature selection approach is presented in Section 3. Section 4 reports on the experiments carried out to assess the proposed approach against previous ones. Limitations of our approach, future work directions and concluding remarks are outlined in Section 5.

# 2 Background Work

The proposed feature selection approach builds on a graph-based representation of multiple textual documents and exploits advantages of contemporary graph databases. This section highlights related background work issues.

## 2.1 Graph-based Text Representations

*Graph-of-words* is a well-known graph-based text representation method. Being similar to the bag-of-words approach that has been widely used in the NLP field, it enables a sophisticated keyword extraction and feature engineering process. In a graph of words, each node represents a unique term (i.e. word) of a document and each edge represents the co-occurrence between two terms within a sliding window of text. The utilization of a small sliding window size, due to the fact that larger ones produce heavily interconnected graphs where the valuable information is cluttered with noise, has been proposed in (Nikolentzos et al., 2017). In this direction, work described in (Rousseau et al., 2015) suggests that a window size of four is generally considered as the appropriate value, since it does not sacrifice either the performance or the accuracy of their approach.
## 2.2 Graph-based Feature Selection

Several interesting graph-based feature selection approaches have been already proposed in the literature. For instance, (Rousseau et al., 2015) proposes various combinations and configurations of popular frequent subgraph mining techniques - such as *gSpan* (Yan and Han, 2002), *Gaston* (Nijssen and Kok, 2004) and *gBoost* (Saigo et al., 2009) - to perform unsupervised feature selection exploiting the k-core subgraph. In particular, aiming to increase performance, Rousseau and his colleagues rely on the concept of k-core subgraph to reduce the graph representation to its densest part. The experimental results show a significant increment of the accuracy compared to common classification approaches. The work reported in (Henni et al., 2018) applies centrality algorithms (such as PageRank) to calculate the centrality score of a graph's features and accordingly identify the most important ones. The approach presented in (Fakhraei et al., 2015) builds on combinations of several types of graph algorithms to discover highly connected features of a graph. Such algorithms include the Louvain Algorithm for community detection and the PageRank algorithm to discover influential nodes and other user-defined graph measures. This last approach combines PageRank and Coloring algorithms with the custom graph measures of in-degree and out-degree.

Other already proposed approaches rely on the recursive filtering of the existing feature space; for instance, one of them re-applies PageRank to find the most influential features (Ienco et al., 2008). These approaches use graph-connected features to include contextual information, as modelled implicitly by a graph structure, using relationships that describe connections among real data. They aim to reduce ambiguity in feature selection and improve accuracy in traditional Machine Learning methods.

## 2.3 Graph Databases

Compared to relational databases, graph databases provide a more convenient and efficient way to natively represent and store highly interlinked data. Moreover, they allow the retrieval of multiple relationships and entities with a single operation, thus avoiding the utilization of rigid join operations which are heavily used in relational databases (Miller, 2013). An in-depth review of graph databases can be found in (Rawat and Kashyap, 2017).

# 3 GraFS: Graph-based Feature Selection

## 3.1 Graph-of-docs Text Representation

To select the most representative features of a corpus of documents, we build on the *graph-of-docs* text representation, first proposed in (Giarelis et al., 2020). Aiming to represent multiple documents in a single graph, the graph-of-docs representation expands the well-known ‘graph-of-words’ model that produces a single graph for each individual document (Rousseau et al., 2013). Graph-of-docs allows diverse types of
nodes and edges to co-exist in a graph, including nodes with types such as `document` and `word`, and edges with types such as `is_similar`, `connects`, `includes`, and `feature` (see Fig. 1).

<figure><img src="image_2.png" /><figcaption>Fig. 1. The schema of the graph-of-docs representation model.</figcaption></figure>

Briefly, according to the graph-of-docs representation:

* each unique word node is connected to all the document nodes where it belongs to using edges of the `includes` type;

* each unique word node selected as a feature is connected to document nodes using edges of the `feature` type;

* edges of `connects` type are only applicable between two word nodes and denote their co-occurrence within a specific sliding text window;

* edges of the `is_similar` type link a pair of document nodes and indicate their contextual similarity.

Graph-of-docs enables us to investigate the importance of a term not only within a single document but also within a whole corpus of documents, which in turn augments the quality of the overall feature selection process.

## 3.2 Feature Selection

Our approach consists of four steps: (i) creation of a document similarity subgraph; (ii) detection of document communities; (iii) feature selection for each community, and (iv) feature selection for the whole corpus of documents.

**Creation of a document similarity subgraph.** We argue that subgraphs from the graph-of-docs graph describing similar documents share common word nodes as well as similar structural characteristics. This enables us to calculate the similarity between two documents by using typical data mining similarity measures, which in turn facilitates the production of a similarity subgraph. The similarity subgraph consists of document nodes and edges of the `is_similar` type.

**Detection of document communities.** By exploiting the document similarity subgraph, we detect communities of contextually similar documents using the `score` property of the `is_similar` type edges as a distance value. A plethora of community detection algorithms can be found in the literature, including *Louvain*, *Label Propagation* and *Weakly Connected Components*.
**Feature selection for each community.** Since documents that are in the same community are contextually similar, we assume that it is also more likely that they share common features (see Fig. 2). Aiming to find the top-N most representative features of each community, GraFS ranks the terms of each community by their document frequency and their PageRank score.

**Feature selection for the whole corpus of documents.** The final step defines the feature space by merging the top-N features of each community. This reduces the number of the candidate features, something that (i) accelerates the feature selection process, (ii) mitigates the effects of the ‘curse-of-dimensionality’ phenomenon, and (iii) enables the training of more reliable ML models.

<figure><img src="image_3.png" /><figcaption>**Fig. 2.** Feature selection using the graph-of-docs text representation model. The selected features, shown within the circle, are linked to documents with edges of 'feature' type. Relationships between documents are denoted with dotted lines.</figcaption></figure>

# 4 Experiments

For the implementation and evaluation of our approach, we used the Python programming language and the scikit-learn ML library (https://scikit-learn.org). The Neo4j graph database (https://neo4j.com) has been utilized for the needs of the graph-of-docs representation. The full code, the documentation and the evaluation results of our experiments are freely available at https://github.com/NCODER/GraphOfDocs.
## 4.1 Baseline Methods

This subsection presents the benchmarks used to evaluate the performance of GraFS. For the implementation of these methods, we used the scikit-learn ML library (implementation details can be found at https://scikit-learn.org/stable/modules/feature_selection.html).

**Low Variance Feature Selection (LVAR).** The first benchmark removes the features that do not meet a predefined variance threshold (Aggarwal, 2018). This method is referred to as *LVAR* in the remainder of this paper (scikit-learn library, class: `sklearn feature selection.VarianceThreshold`).

**Univariate Feature Selection (KBEST).** The second benchmark relies on univariate statistical tests to select the k-best features (Aggarwal, 2018). In particular, it attempts to find correlations between an individual feature and a document class. In this paper, we adopt the $x^2$ test as our main statistical test. This method is referred to as *KBEST* in the remainder of this paper (scikit-learn library, classes: `sklearn feature selection>SelectKBest` and `sklearn feature selection>SelectKBest chi2`).

**Feature Selection using a meta-transformer model (META).** The third benchmark uses a meta-transformer model to retain only the features with significant importance. It is assumed that a statistical model (e.g. logistic regression) provides importance metrics for each feature to be considered as a candidate meta-transformer model. Available meta-transformer models include logistic regression, linear SVM and neural networks, as well as more sophisticated methods such as word embeddings (e.g. `word2vec` (Mikolov et al., 2013)). In this paper, we use the linear SVM model, since it performs well regardless of the number of samples or the number of unique features of a dataset. In the remainder of the paper, this method is referred to as *META* (scikit-learn library, classes: `sklearn feature selection>SelectFromModel` and `sklearn svm LinearSVC`).

## 4.2 Datasets

This subsection describes the datasets used in our experiments to evaluate the performance of GraFS. These datasets are available at https://github.com/imis-lab/aiai-2020-datasets.

**20Newsgroups.** We tested the proposed model by utilizing an already preprocessed version of the well-known 20Newsgroups dataset, which is a collection of approximately 20,000 newsgroup documents, partitioned evenly across 20 different newsgroups. As far as the multi-class text classification task is concerned, this dataset fits well to the purposes of our experimentations since it provides a large volume of different documents on the same subjects.

**Reuters.** We tested the proposed model on a preprocessed version of the Reuters dataset, which includes 21,578 news stories; since almost half of them lack the class field, we used only the ones that came along with their class (i.e. 10,377). For each news story, certain attributes were retained; for instance, the 'title' attribute that con-
tains the title of the story and the 'body' attribute that contains the main text of the news story. In this paper, we used this dataset to execute experiments related to the multi-class text classification task.

**Amazon Reviews.** We also tested the proposed model on a preprocessed version of the Amazon Reviews dataset, which contains labeled (positive or negative) reviews of products belonging to different categories (e.g. automotive, electronics, grocery etc.). We picked four product categories (i.e. books, DVD, electronics, kitchen), each having 1000 positive and 1000 negative reviews. We utilized this dataset to conduct experiments related to the opinion mining task.

**LingSpam.** The LingSpam dataset (Androutsopoulos et al., 2000) contains 2,893 email messages, which are classified either as 'spam' or 'not spam'. We utilized this dataset to conduct experiments related to the spam detection task.

**JiraIssues.** The JiraIssues dataset, concerns the development of 168 software projects including 'Hadoop', 'Spark' and 'Airflow'. It contains information related to 228,969 Jira issues. Each Jira issue in this dataset has the attributes 'description', and 'assignee'. The set of the document classes of the dataset corresponds to the names of the available employees ('assignee' attribute). This dataset was retrieved from the publicly accessible Jira instance of Apache Software Foundation (https://issues.apache.org/jira). We utilized it to execute experiments related to the multi-class text classification task.

<table><caption>**Table 1.** The hyper-parameters of each feature selection method per dataset.</caption><thead><tr><td>Method</td><td>Dataset</td><td>Hyper-parameter</td><td>Values</td></tr></thead><tbody><tr><td>LVAR</td><td>20Newsgroups, Reuters, Amazon, LingSpam, JiraIssues</td><td>variance threshold</td><td>[0.0005, 0.001, 0.0015, 0.002, 0.003, 0.004, 0.005, 0.01]</td></tr><tr><td>GraFS</td><td>20Newsgroups, Reuters, Amazon, LingSpam, JiraIssues</td><td>top-N</td><td>[5, 10, 15, 20, 25, 50, 100, 250, 500]</td></tr><tr><td>KBEST</td><td>20Newsgroups</td><td>k</td><td>[1000, 2000, 3000, 5000, 10000, 15000, 20000, 25000, 30000]</td></tr><tr><td>KBEST</td><td>Reuters, Amazon, JiraIssues</td><td>k</td><td>[1000, 2000, 3000, 5000, 6000, 7000, 8000, 10000, 14000]</td></tr><tr><td>KBEST</td><td>LingSpam</td><td>k</td><td>[250, 500, 1000, 1500, 2000, 2500, 3000, 4000, 5000]</td></tr></tbody></table>
4.3 Experimental setup

To identify the most important words in the entire corpus of documents, we selected to use the PageRank algorithm, since it performs well regardless of the topics of the documents. To identify similar documents needed for the generation of the document similarity subgraph, we used the Jaccard similarity measure since it deals only with the absence or the presence of a word, ignoring its document frequency. To form communities of similar documents, we used the Louvain community detection algorithm. Finally, we executed several experiments with different hyperparameter values for the LVAR, KBEST and GraFS feature selection methods. Table 1 summarizes the values given to these hyperparameters per dataset.

4.4 Evaluation

To evaluate the effectiveness of our approach, we assess the contribution of GraFS in the accuracy of widely used text classifiers against the bag-of-words (BOW) text representation and the three domain-agnostic feature selection techniques described in Section 4.1 (see Table 2). The text classifiers considered are: naive Bayes (NB), k-nearest neighbors (5NN), logistic regression (LR), neural networks (NN100x50) and linear support vector machines (LSVM). It is noted that in the case of BOW, none of the feature selection techniques has been applied to the specific experiment. Results obtained show that GraFS (i) increases the accuracy in most cases, and (ii) decreases the number of features required to achieve ‘state-of-the-art’ accuracy (Fig. 3 – right part). Fig. 3 illustrates the accuracy of the LSVM classifier per number of selected features for the GraFS, KBEST and LVAR feature selection techniques (additional comparisons can be retrieved from https://github.com/imis-lab/aiai-2020-datasets).

<figure><img src="image_4.png" /><figcaption>**Fig. 3.** Accuracy of the LSVM classifier per number of selected features for the GraFS (TOPN), KBEST and LVAR feature selection techniques on 20Newsgroups (left) and JiraIssues (right) datasets.</figcaption></figure>
<table><caption>**Table 2.** Accuracy score (acc) and number of features (|f|) per text classifier for each feature selection technique on the five selected textual datasets. * and bold font highlights the best method for a specific dataset as far as the accuracy score and the number of features are concerned.</caption><thead><tr><th rowspan="2">Method</th><th colspan="2">20Newsgroups</th><th colspan="2">Reuters</th><th colspan="2">Amazon</th><th colspan="2">LingSpam</th><th colspan="2">JiraIssues</th></tr><tr><th>acc</th><th>|f|</th><th>acc</th><th>|f|</th><th>acc</th><th>|f|</th><th>acc</th><th>|f|</th><th>acc</th><th>|f|</th></tr></thead><tbody><tr><td>GraFS+5NN</td><td>0.7192</td><td>20942</td><td>0.8272</td><td>809</td><td>0.6786</td><td>1065</td><td>0.9926</td><td>120</td><td>0.682</td><td>905</td></tr><tr><td>GraFS+NB</td><td>0.9421</td><td>20942</td><td>0.8399</td><td>7171</td><td>0.7273</td><td>1940</td><td>0.9963</td><td>2274</td><td>0.6958</td><td>6404</td></tr><tr><td>GraFS+LR</td><td>0.9402</td><td>37281</td><td><span style="color:red;">0.8782*</span></td><td>7171</td><td>0.776</td><td>4897</td><td><span style="color:red;">1.0*</span></td><td>120</td><td>0.7517</td><td>2598</td></tr><tr><td>GraFS+NN100x50</td><td><span style="color:red;">0.9575*</span></td><td>30793</td><td>0.8733</td><td>8187</td><td>0.7403</td><td>1940</td><td>1.0</td><td>758</td><td><span style="color:red;">0.7542*</span></td><td>6404</td></tr><tr><td>GraFS+LSVM</td><td>0.9392</td><td>39694</td><td>0.8737</td><td>7171</td><td>0.763</td><td>4897</td><td>0.9963</td><td>120</td><td>0.7348</td><td>3045</td></tr><tr><td>BOW+5NN</td><td>0.643</td><td>62384</td><td>0.7582</td><td>15514</td><td>0.6169</td><td>9771</td><td>0.8333</td><td>16695</td><td>0.6486</td><td>14539</td></tr><tr><td>BOW+NB</td><td>0.9361</td><td>62384</td><td>0.8191</td><td>15514</td><td>0.7208</td><td>9771</td><td>0.9963</td><td>16695</td><td>0.6989</td><td>14539</td></tr><tr><td>BOW+LR</td><td>0.9387</td><td>62384</td><td>0.8746</td><td>15514</td><td>0.763</td><td>9771</td><td>1.0</td><td>16695</td><td>0.7461</td><td>14539</td></tr><tr><td>BOW+NN100X50</td><td>0.9546</td><td>62384</td><td>0.8656</td><td>15514</td><td>0.7273</td><td>9771</td><td>0.9963</td><td>16695</td><td>0.741</td><td>14539</td></tr><tr><td>BOW+LSVM</td><td>0.9408</td><td>62384</td><td>0.8742</td><td>15514</td><td>0.763</td><td>9771</td><td>1.0</td><td>16695</td><td>0.7304</td><td>14539</td></tr><tr><td>LVAR+5NN</td><td>0.6942</td><td>4880</td><td>0.8209</td><td>1482</td><td>0.7013</td><td>1719</td><td>0.8926</td><td>5464</td><td>0.6493</td><td>2771</td></tr><tr><td>LVAR+NB</td><td>0.94</td><td>29992</td><td>0.8403</td><td>3356</td><td>0.737</td><td>2906</td><td>0.9963</td><td>8234</td><td>0.7373</td><td>5833</td></tr><tr><td>LVAR+LR</td><td>0.9384</td><td>29992</td><td>0.8755</td><td>7624</td><td>0.7792</td><td>3637</td><td>1.0</td><td>8234</td><td>0.7442</td><td>9706</td></tr><tr><td>LVAR+NN100X50</td><td>0.9541</td><td>29992</td><td>0.8724</td><td>4870</td><td>0.75</td><td>1719</td><td>1.0</td><td>11058</td><td>0.7398</td><td>6489</td></tr><tr><td>LVAR+LSVM</td><td>0.9368</td><td>29992</td><td>0.8746</td><td>7624</td><td>0.7825</td><td>1719</td><td>1.0</td><td>16695</td><td>0.7291</td><td>9706</td></tr><tr><td>KBEST+5NN</td><td>0.721</td><td>5000</td><td>0.7957</td><td>6000</td><td>0.724</td><td>350</td><td>0.9778</td><td>5000</td><td>0.6644</td><td>4000</td></tr><tr><td>KBEST+NB</td><td>0.9374</td><td>25000</td><td>0.8354</td><td>7000</td><td>0.75</td><td>500</td><td>0.9963</td><td>3000</td><td>0.6952</td><td>14000</td></tr><tr><td>KBEST+LR</td><td>0.9389</td><td>30000</td><td>0.8764</td><td>10000</td><td>0.7727</td><td>3000</td><td>1.0</td><td>1000</td><td>0.7461</td><td>6000</td></tr><tr><td>KBEST+NN100X50</td><td>0.9564</td><td>30000</td><td>0.8705</td><td>14000</td><td>0.7565</td><td>1000</td><td>1.0</td><td>1000</td><td>0.7423</td><td>10000</td></tr><tr><td>KBEST+LSVM</td><td>0.9366</td><td>30000</td><td>0.8737</td><td>14000</td><td>0.763</td><td>6000</td><td>1.0</td><td>1000</td><td>0.7253</td><td>6000</td></tr><tr><td>META+5NN</td><td>0.6542</td><td>14907</td><td>0.8002</td><td>2494</td><td>0.6623</td><td>2731</td><td>0.8704</td><td>2509</td><td>0.6329</td><td>2942</td></tr><tr><td>META+NB</td><td>0.9387</td><td>14907</td><td>0.8376</td><td>2494</td><td>0.737</td><td>2731</td><td>0.9963</td><td>2509</td><td>0.6989</td><td>2942</td></tr><tr><td>META+LR</td><td>0.9376</td><td>14907</td><td>0.876</td><td>2494</td><td><span style="color:red;">0.789*</span></td><td>2731</td><td>1.0</td><td>2509</td><td>0.7461</td><td>2942</td></tr><tr><td>META+NN100X50</td><td>0.952</td><td>14907</td><td>0.8701</td><td>2494</td><td>0.75</td><td>2731</td><td>1.0</td><td>2509</td><td>0.7467</td><td>2942</td></tr><tr><td>META+LSVM</td><td>0.9408</td><td>14907</td><td>0.8746</td><td>2494</td><td>0.7727</td><td>2731</td><td>1.0</td><td>2509</td><td>0.731</td><td>2942</td></tr></tbody></table>
Our approach differs from the existing ones in that it considers the whole corpus of documents (instead of each document separately) and the associated relationships between the words. Thus, the feature set selected using GraFS contains the most influential features of a document corpus. Hence, GraFS reduces the number of the selected features, which in turn mitigates the effects of the ‘curse-of-dimensionality’ phenomenon, i.e. the production of over-fitted ML models and sparse feature vectors. Contrary to our approach, common feature selection methods that are based on statistics ignore the interconnections between the terms (both within a single document and across the documents of a corpus), which has as effect that more features are required from the text classifiers to perform equally well (see the left graph in Fig. 3).

# 5 Conclusions

This paper introduces a new approach for graph-based feature selection, namely *GraFS*. To test the proposed approach, we benchmarked GraFS against classical feature selection techniques. The evaluation outcome was very promising; state-of-the-art accuracy has been achieved in the classification of five well-known datasets using fewer features. In any case, our approach demonstrates two limitations: (i) it is unable to select features for outlier documents, i.e. documents that are not similar to any other document, and (ii) it requires significant time to generate the corresponding graph of documents in a disk-based graph database.

Aiming to address the above limitations as well as to integrate our approach into existing works on knowledge management systems, future work directions include: (i) the utilization and assessment of an in-memory graph database in combination with Neo4j; (ii) the exploitation of link prediction algorithms to deal with outlier documents; (iii) the application of graph and word embedding techniques, and (iv) the integration of our approach into collaborative argumentation environments where the underlying knowledge is structured through semantically-rich discourse graphs (e.g. integration with the approaches described in (Kanterakis et al., 2019) and (Karacapilidis et al., 2009)).

**Acknowledgments.** The work presented in this paper is supported by the OpenBio-C project (www.openbio.eu), which is co-financed by the European Union and Greek national funds through the Operational Program Competitiveness, Entrepreneurship and Innovation, under the call RESEARCH – CREATE – INNOVATE (Project id: T1EDK-05275).

# References

1. Aggarwal, C. C.: Machine learning for text. Springer International Publishing (2018)

2. Androutsopoulos, I., Koutsias, J., Chandrinos, K., Paliouras, G., Spyropoulos, C.: An Evaluation of Naïve Bayesian Anti-Spam Filtering. In Proceedings of the Workshop on Machine Learning in the New Information Age, 11th European Conference on Machine Learning, pp. 9–17 (2000)
3. Fakhraei, S., Foulds, J., Shashanka, M., Getoor, L.: Collective spammer detection in evolving multi-relational social networks. In Proceedings of the 21 ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1769-1778 (2015)

4. Giarelis, N., Kanakaris, N., Karacapilidis, N.: On a novel representation of multiple textual documents in a single graph. In I. Czarnowski, R.J.Howlett and L.C.Jain (eds.) Intelligent Decision Technologies 2020 – Proc. of the 12th KES International Conference on Intelligent Decision Technologies (KES-IDT-20), Split, Croatia, June 17-19, 2020, Springer.

5. Henni, K., Mezghani, N., Gouin-Vallerand, C.: Unsupervised graph-based feature selection via subspace and pagerank centrality. Expert Systems with Applications, 114, pp. 46-53 (2018)

6. Ienco, D., Meo, R., Botta, M. Using pagerank in feature selection. In SEBD, pp. 93–100 (2008)

7. Kanterakis, A., Iatraki, G., Pityanou, K., Koumakis, L., Kanakaris, N., Karacapilidis, N., Potamias, G.: Towards Reproducible Bioinformatics: The OpenBio-C Scientific Workflow Environment. In: Proceedings of the 19th IEEE International Conference on Bioinformatics and Bioengineering (BIBE), pp. 221-226, Athens, Greece (2019)

8. Karacapilidis, N., Tzagarakis, M., Karousos, N., Gkotsis, G., Kallistros, V., Christodoulou, S., Mettouris, C., Nousia, D.: Tackling cognitively-complex collaboration with CoPe-it!. International Journal of Web-Based Learning and Teaching Technologies, vol. 4, no. 3, pp. 22-38 (2009)

9. Mikolov, T., Sutskever, I., Chen, K., Corrado, G. S., Dean, J.: Distributed representations of words and phrases and their compositionality. In Advances in neural information processing systems (NeurIPS), pp. 3111-3119 (2013)

10. Miller, J. J.: Graph database applications and concepts with Neo4j. In Proc. of the Southern Assoc. for Information Systems Conference, vol. 2324, no. 36, Atlanta, USA (2013)

11. Nijssen, S., Kok, J. N.: A quickstart in frequent structure mining can make a difference. In Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 647-652, ACM Press (2004)

12. Nikolentzos, G., Meladianos, P., Rousseau, F., Stavrakas, Y., Vazirgiannis, M.: Shortest-path graph kernels for document similarity. In Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing, pp. 1890-1900 (2017)

13. Rawat, D. S., Kashyap, N. K.: Graph Database: A Complete GDBMS Survey. International Journal 3, 217-226 (2017)

14. Rousseau, F., Kiagias, E., Vazirgiannis, M.: Text categorization as a graph classification problem. In Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing, vol. 1, pp. 1702-1712 (2015)

15. Rousseau, F., Vazirgiannis, M.: Graph-of-word and TW-IDF: new approach to ad hoc IR. In Proceedings of the 22nd ACM International Conference on Information & Knowledge Management, pp. 59-68, ACM Press (2013)

16. Saigo, H., Nowozin, S., Kadowaki, T., Kudo, T., Tsuda, K.: gBoost: a mathematical programming approach to graph classification and regression. Machine Learning 75(1), pp. 69-89 (2009)

17. Vazirgiannis, M., Malliaros, F., Nikolentzos, G.: GraphRep: Boosting Text Mining, NLP and Information Retrieval with Graphs. In Proc. of the 27th ACM International Conference on Information and Knowledge Management, pp. 2295-2296 (2018)

18. Yan, X., Han, J.: gspan: Graph-based substructure pattern mining. In Proceedings of the IEEE International Conference on Data Mining, pp. 721-724, IEEE Press (2002)