Loading…

Collaboration graph for feature set partitioning in data classification

•A measure defined to show the effectiveness of each two features in classification.•Collaboration Graph (CG) represents the measure as an edge between each two features.•Community detection is used on CG to specify informative feature subsets.•The approach has been tested successfully on real and s...

Full description

Saved in:
Bibliographic Details
Published in:Expert systems with applications 2023-03, Vol.213, p.118988, Article 118988
Main Authors: Taheri, Khalil, Moradi, Hadi, Tavassolipour, Mostafa
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c230t-647adb09979fbe6f704089540c96583d19ac43f853b71a6bbeee97c89416ac243
cites cdi_FETCH-LOGICAL-c230t-647adb09979fbe6f704089540c96583d19ac43f853b71a6bbeee97c89416ac243
container_end_page
container_issue
container_start_page 118988
container_title Expert systems with applications
container_volume 213
creator Taheri, Khalil
Moradi, Hadi
Tavassolipour, Mostafa
description •A measure defined to show the effectiveness of each two features in classification.•Collaboration Graph (CG) represents the measure as an edge between each two features.•Community detection is used on CG to specify informative feature subsets.•The approach has been tested successfully on real and synthetic data. The curse of dimensionality of features in data classification is still an open issue. An approach to solve this problem is to partition features into several sub-sets of features hence the data classification task for every subset is performed. Then, an ensemble of these classifications are reported as the result of the classification problem. However, the feature set partitioning into sub-sets of features is still an area of research interest. Thus, in this paper, an innovative framework is proposed in which, first, a collaboration measure between each two features is defined and measured. Then, the collaboration graph, consisted of features as nodes and measured collaborations as edges’ weights, is generated according to the collaboration measures calculated. After that, a community detection method is used to find the graph communities. The communities are considered as the feature subsets and a base classifier is trained for each subset based on the corresponding training data of the subsets. Then, the ensemble classifier is created by a combination of base classifiers according to the AdaBoost Aggreagation. The simulation results of the proposed approach over the real and synthetic datasets indicate that the proposed approach considerably increases the classification accuracy in comparison to previous methods.
doi_str_mv 10.1016/j.eswa.2022.118988
format article
fullrecord <record><control><sourceid>elsevier_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1016_j_eswa_2022_118988</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0957417422020061</els_id><sourcerecordid>S0957417422020061</sourcerecordid><originalsourceid>FETCH-LOGICAL-c230t-647adb09979fbe6f704089540c96583d19ac43f853b71a6bbeee97c89416ac243</originalsourceid><addsrcrecordid>eNp9kM1KxDAUhYMoOI6-gKu8QGvSpPkBNzLoKAy40XW4TW_GDLUdkqj49k4d167O4vAdDh8h15zVnHF1s6sxf0HdsKapOTfWmBOy4EaLSmkrTsmC2VZXkmt5Ti5y3jHGNWN6QdaraRigmxKUOI10m2D_RsOUaEAoHwlpxkL3kEqc-zhuaRxpDwWoHyDnGKL_JS_JWYAh49VfLsnrw_3L6rHaPK-fVnebyjeClUpJDX3HrNU2dKiCZpIZ20rmrWqN6LkFL0Uwreg0B9V1iGi1N1ZyBb6RYkma465PU84Jg9un-A7p23HmZhVu52YVblbhjioO0O0RwsOzz4jJZR9x9NjHhL64for_4T9HEmhX</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Collaboration graph for feature set partitioning in data classification</title><source>Elsevier:Jisc Collections:Elsevier Read and Publish Agreement 2022-2024:Freedom Collection (Reading list)</source><creator>Taheri, Khalil ; Moradi, Hadi ; Tavassolipour, Mostafa</creator><creatorcontrib>Taheri, Khalil ; Moradi, Hadi ; Tavassolipour, Mostafa</creatorcontrib><description>•A measure defined to show the effectiveness of each two features in classification.•Collaboration Graph (CG) represents the measure as an edge between each two features.•Community detection is used on CG to specify informative feature subsets.•The approach has been tested successfully on real and synthetic data. The curse of dimensionality of features in data classification is still an open issue. An approach to solve this problem is to partition features into several sub-sets of features hence the data classification task for every subset is performed. Then, an ensemble of these classifications are reported as the result of the classification problem. However, the feature set partitioning into sub-sets of features is still an area of research interest. Thus, in this paper, an innovative framework is proposed in which, first, a collaboration measure between each two features is defined and measured. Then, the collaboration graph, consisted of features as nodes and measured collaborations as edges’ weights, is generated according to the collaboration measures calculated. After that, a community detection method is used to find the graph communities. The communities are considered as the feature subsets and a base classifier is trained for each subset based on the corresponding training data of the subsets. Then, the ensemble classifier is created by a combination of base classifiers according to the AdaBoost Aggreagation. The simulation results of the proposed approach over the real and synthetic datasets indicate that the proposed approach considerably increases the classification accuracy in comparison to previous methods.</description><identifier>ISSN: 0957-4174</identifier><identifier>EISSN: 1873-6793</identifier><identifier>DOI: 10.1016/j.eswa.2022.118988</identifier><language>eng</language><publisher>Elsevier Ltd</publisher><subject>AdaBoost Algorithm ; Community Detection ; Ensemble Classification ; Features Collaboration Graph</subject><ispartof>Expert systems with applications, 2023-03, Vol.213, p.118988, Article 118988</ispartof><rights>2022 Elsevier Ltd</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c230t-647adb09979fbe6f704089540c96583d19ac43f853b71a6bbeee97c89416ac243</citedby><cites>FETCH-LOGICAL-c230t-647adb09979fbe6f704089540c96583d19ac43f853b71a6bbeee97c89416ac243</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Taheri, Khalil</creatorcontrib><creatorcontrib>Moradi, Hadi</creatorcontrib><creatorcontrib>Tavassolipour, Mostafa</creatorcontrib><title>Collaboration graph for feature set partitioning in data classification</title><title>Expert systems with applications</title><description>•A measure defined to show the effectiveness of each two features in classification.•Collaboration Graph (CG) represents the measure as an edge between each two features.•Community detection is used on CG to specify informative feature subsets.•The approach has been tested successfully on real and synthetic data. The curse of dimensionality of features in data classification is still an open issue. An approach to solve this problem is to partition features into several sub-sets of features hence the data classification task for every subset is performed. Then, an ensemble of these classifications are reported as the result of the classification problem. However, the feature set partitioning into sub-sets of features is still an area of research interest. Thus, in this paper, an innovative framework is proposed in which, first, a collaboration measure between each two features is defined and measured. Then, the collaboration graph, consisted of features as nodes and measured collaborations as edges’ weights, is generated according to the collaboration measures calculated. After that, a community detection method is used to find the graph communities. The communities are considered as the feature subsets and a base classifier is trained for each subset based on the corresponding training data of the subsets. Then, the ensemble classifier is created by a combination of base classifiers according to the AdaBoost Aggreagation. The simulation results of the proposed approach over the real and synthetic datasets indicate that the proposed approach considerably increases the classification accuracy in comparison to previous methods.</description><subject>AdaBoost Algorithm</subject><subject>Community Detection</subject><subject>Ensemble Classification</subject><subject>Features Collaboration Graph</subject><issn>0957-4174</issn><issn>1873-6793</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><recordid>eNp9kM1KxDAUhYMoOI6-gKu8QGvSpPkBNzLoKAy40XW4TW_GDLUdkqj49k4d167O4vAdDh8h15zVnHF1s6sxf0HdsKapOTfWmBOy4EaLSmkrTsmC2VZXkmt5Ti5y3jHGNWN6QdaraRigmxKUOI10m2D_RsOUaEAoHwlpxkL3kEqc-zhuaRxpDwWoHyDnGKL_JS_JWYAh49VfLsnrw_3L6rHaPK-fVnebyjeClUpJDX3HrNU2dKiCZpIZ20rmrWqN6LkFL0Uwreg0B9V1iGi1N1ZyBb6RYkma465PU84Jg9un-A7p23HmZhVu52YVblbhjioO0O0RwsOzz4jJZR9x9NjHhL64for_4T9HEmhX</recordid><startdate>20230301</startdate><enddate>20230301</enddate><creator>Taheri, Khalil</creator><creator>Moradi, Hadi</creator><creator>Tavassolipour, Mostafa</creator><general>Elsevier Ltd</general><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20230301</creationdate><title>Collaboration graph for feature set partitioning in data classification</title><author>Taheri, Khalil ; Moradi, Hadi ; Tavassolipour, Mostafa</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c230t-647adb09979fbe6f704089540c96583d19ac43f853b71a6bbeee97c89416ac243</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>AdaBoost Algorithm</topic><topic>Community Detection</topic><topic>Ensemble Classification</topic><topic>Features Collaboration Graph</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Taheri, Khalil</creatorcontrib><creatorcontrib>Moradi, Hadi</creatorcontrib><creatorcontrib>Tavassolipour, Mostafa</creatorcontrib><collection>CrossRef</collection><jtitle>Expert systems with applications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Taheri, Khalil</au><au>Moradi, Hadi</au><au>Tavassolipour, Mostafa</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Collaboration graph for feature set partitioning in data classification</atitle><jtitle>Expert systems with applications</jtitle><date>2023-03-01</date><risdate>2023</risdate><volume>213</volume><spage>118988</spage><pages>118988-</pages><artnum>118988</artnum><issn>0957-4174</issn><eissn>1873-6793</eissn><abstract>•A measure defined to show the effectiveness of each two features in classification.•Collaboration Graph (CG) represents the measure as an edge between each two features.•Community detection is used on CG to specify informative feature subsets.•The approach has been tested successfully on real and synthetic data. The curse of dimensionality of features in data classification is still an open issue. An approach to solve this problem is to partition features into several sub-sets of features hence the data classification task for every subset is performed. Then, an ensemble of these classifications are reported as the result of the classification problem. However, the feature set partitioning into sub-sets of features is still an area of research interest. Thus, in this paper, an innovative framework is proposed in which, first, a collaboration measure between each two features is defined and measured. Then, the collaboration graph, consisted of features as nodes and measured collaborations as edges’ weights, is generated according to the collaboration measures calculated. After that, a community detection method is used to find the graph communities. The communities are considered as the feature subsets and a base classifier is trained for each subset based on the corresponding training data of the subsets. Then, the ensemble classifier is created by a combination of base classifiers according to the AdaBoost Aggreagation. The simulation results of the proposed approach over the real and synthetic datasets indicate that the proposed approach considerably increases the classification accuracy in comparison to previous methods.</abstract><pub>Elsevier Ltd</pub><doi>10.1016/j.eswa.2022.118988</doi></addata></record>
fulltext fulltext
identifier ISSN: 0957-4174
ispartof Expert systems with applications, 2023-03, Vol.213, p.118988, Article 118988
issn 0957-4174
1873-6793
language eng
recordid cdi_crossref_primary_10_1016_j_eswa_2022_118988
source Elsevier:Jisc Collections:Elsevier Read and Publish Agreement 2022-2024:Freedom Collection (Reading list)
subjects AdaBoost Algorithm
Community Detection
Ensemble Classification
Features Collaboration Graph
title Collaboration graph for feature set partitioning in data classification
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-01T03%3A12%3A09IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-elsevier_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Collaboration%20graph%20for%20feature%20set%20partitioning%20in%20data%20classification&rft.jtitle=Expert%20systems%20with%20applications&rft.au=Taheri,%20Khalil&rft.date=2023-03-01&rft.volume=213&rft.spage=118988&rft.pages=118988-&rft.artnum=118988&rft.issn=0957-4174&rft.eissn=1873-6793&rft_id=info:doi/10.1016/j.eswa.2022.118988&rft_dat=%3Celsevier_cross%3ES0957417422020061%3C/elsevier_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c230t-647adb09979fbe6f704089540c96583d19ac43f853b71a6bbeee97c89416ac243%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true