Explainable graph clustering via expanders in the massively parallel computation model
Explainable clustering provides human-understandable reasons for decisions in black-box learning models. In a previous work, a decision tree built on the set of dimensions was used to define ranges of values for k-means clusters. For explainable graph clustering, we use expander graphs instead of de...
Gespeichert in:
| Veröffentlicht in: | Information sciences Jg. 677; S. 120897 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier Inc
01.08.2024
|
| Schlagworte: | |
| ISSN: | 0020-0255 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | Explainable clustering provides human-understandable reasons for decisions in black-box learning models. In a previous work, a decision tree built on the set of dimensions was used to define ranges of values for k-means clusters. For explainable graph clustering, we use expander graphs instead of dense subgraphs since powering an expander graph is guaranteed to result in a clique after at most a logarithmic number of steps.
Consider a set of multi-dimensional points labeled with k labels. We introduce the heat map sorting problem as reordering the rows and columns of an input matrix (each point is a column and each row is a dimension) such that the labels of the entries of the matrix form connected components (clusters). A cluster is preserved if it remains connected, i.e., if it is not split into several clusters and no two clusters are merged. In the massively parallel computation model (MPC), each machine has a sublinear memory and the total memory of the machines is linear.
We prove the problem is NP-hard. We give a fixed-parameter algorithm in MPC and an approximation algorithm based on expander decomposition. We empirically compare our algorithm with explainable k-means on several graphs of email and computer networks.
•A general method for explainable clustering of high-dimensional data.•A fixed-parameter algorithms for explainable graph clustering.•A Massively Parallel Computation (MPC) algorithm for explainable clustering.•An approximation algorithm for graph clustering on expander graphs. |
|---|---|
| AbstractList | Explainable clustering provides human-understandable reasons for decisions in black-box learning models. In a previous work, a decision tree built on the set of dimensions was used to define ranges of values for k-means clusters. For explainable graph clustering, we use expander graphs instead of dense subgraphs since powering an expander graph is guaranteed to result in a clique after at most a logarithmic number of steps.
Consider a set of multi-dimensional points labeled with k labels. We introduce the heat map sorting problem as reordering the rows and columns of an input matrix (each point is a column and each row is a dimension) such that the labels of the entries of the matrix form connected components (clusters). A cluster is preserved if it remains connected, i.e., if it is not split into several clusters and no two clusters are merged. In the massively parallel computation model (MPC), each machine has a sublinear memory and the total memory of the machines is linear.
We prove the problem is NP-hard. We give a fixed-parameter algorithm in MPC and an approximation algorithm based on expander decomposition. We empirically compare our algorithm with explainable k-means on several graphs of email and computer networks.
•A general method for explainable clustering of high-dimensional data.•A fixed-parameter algorithms for explainable graph clustering.•A Massively Parallel Computation (MPC) algorithm for explainable clustering.•An approximation algorithm for graph clustering on expander graphs. |
| ArticleNumber | 120897 |
| Author | Ghodsi, Mohammad Aghamolaei, Sepideh |
| Author_xml | – sequence: 1 givenname: Sepideh orcidid: 0000-0003-1667-6323 surname: Aghamolaei fullname: Aghamolaei, Sepideh email: sepideh.aghamolaei14@sharif.edu organization: Department of Computer Engineering, Sharif University of Technology, Azadi Ave., Tehran, 1458889694, Tehran, Iran – sequence: 2 givenname: Mohammad surname: Ghodsi fullname: Ghodsi, Mohammad email: ghodsi@sharif.edu organization: Department of Computer Engineering, Sharif University of Technology, Azadi Ave., Tehran, 1458889694, Tehran, Iran |
| BookMark | eNp90L1OwzAUhmEPRaItXACbbyDh2LGTWEyoKj9SJRZgtRznpHXlOJEdqvbuaVVmpjO9R5-eBZmFISAhDwxyBqx83OcupJwDFznjUKtqRuYAHDLgUt6SRUp7ABBVWc7J9_o4euOCaTzSbTTjjlr_kyaMLmzpwRmKx9GEFmOiLtBph7Q3KbkD-hMdTTTeo6d26MefyUxuCLQfWvR35KYzPuH9312Sr5f15-ot23y8vq-eN5nlQk2ZEoq3DUqo61owgUyyopNlW0kobAO2sqIuLFNlYzuFAg2rUJamYFZ1WJuqWBJ2_WvjkFLETo_R9SaeNAN9wdB7fcbQFwx9xTg3T9cGz8MODqNO1mGw2LqIdtLt4P6pfwETHGzt |
| Cites_doi | 10.1145/1217299.1217301 10.1093/bioinformatics/btac478 10.1016/j.cell.2009.12.018 10.14778/1454159.1454223 10.1016/j.patcog.2022.109239 10.4049/jimmunol.1300093 10.1371/journal.ppat.1011981 10.1002/cti2.1139 10.1097/MD.0000000000034843 10.1109/JIOT.2022.3228816 10.1145/3125644 |
| ContentType | Journal Article |
| Copyright | 2024 Elsevier Inc. |
| Copyright_xml | – notice: 2024 Elsevier Inc. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.ins.2024.120897 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Library & Information Science |
| ExternalDocumentID | 10_1016_j_ins_2024_120897 S0020025524008119 |
| GroupedDBID | --K --M --Z -~X .DC .~1 0R~ 1B1 1OL 1RT 1~. 1~5 29I 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXKI AAXUO AAYFN ABAOU ABBOA ABEFU ABFNM ABJNI ABMAC ABTAH ABUCO ABWVN ABXDB ACDAQ ACGFS ACNNM ACRLP ACRPL ACZNC ADBBV ADEZE ADGUI ADJOM ADMUD ADNMO ADTZH ADVLN AEBSH AECPX AEKER AENEX AFFNX AFJKZ AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIGVJ AIKHN AITUG AJOXV AKRWK ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CS3 DU5 EBS EFJIC EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX HLZ HVGLF HZ~ H~9 IHE J1W JJJVA KOM LG9 LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SBC SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SST SSV SSW SSZ T5K TN5 TWZ UHS WH7 WUQ XPP YYP ZMT ZY4 ~02 ~G- 77I 9DU AATTM AAYWO AAYXX ACLOT ACVFH ADCNI AEIPS AEUPX AFPUW AGQPQ AIGII AIIUN AKBMS AKYEP ANKPU APXCP CITATION EFKBS EFLBG ~HD |
| ID | FETCH-LOGICAL-c249t-9492dbe50888414e1513f56d7503cb0c7c483c196bcf9e4ea17e56a31c9fe8a73 |
| ISICitedReferencesCount | 1 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001302611500001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0020-0255 |
| IngestDate | Sat Nov 29 02:44:14 EST 2025 Sat Dec 28 15:52:45 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Expander graphs DBSCAN Explainable clustering Fixed-parameter algorithms Massively parallel computation |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c249t-9492dbe50888414e1513f56d7503cb0c7c483c196bcf9e4ea17e56a31c9fe8a73 |
| ORCID | 0000-0003-1667-6323 |
| ParticipantIDs | crossref_primary_10_1016_j_ins_2024_120897 elsevier_sciencedirect_doi_10_1016_j_ins_2024_120897 |
| PublicationCentury | 2000 |
| PublicationDate | August 2024 2024-08-00 |
| PublicationDateYYYYMMDD | 2024-08-01 |
| PublicationDate_xml | – month: 08 year: 2024 text: August 2024 |
| PublicationDecade | 2020 |
| PublicationTitle | Information sciences |
| PublicationYear | 2024 |
| Publisher | Elsevier Inc |
| Publisher_xml | – name: Elsevier Inc |
| References | Zhou, Wang, Sun, Zhou, Wang, Wang, Zhang, Luo, Yu (br0270) 2023; 102 Ye, Gaugler, Mohty, Malard (br0300) 2020; 9 Holzinger, Saranti, Molnar, Biecek, Samek (br0020) 2022 Hashem, Gravel, Chen, Yi, Tocchi, Jaentschke, Fan, Li, Rosu-Myles, Pereboev (br0280) 2014; 193 Beame, Koutris, Suciu (br0100) 2017; 64 Zenklusen (br0190) 2019 Yin, Benson, Leskovec, Gleich (br0230) 2017 Andoni, Song, Stein, Wang, Zhong (br0150) 2018 Fish, Kun, Lelkes, Reyzin, Turán (br0120) 2015 Leskovec, Kleinberg, Faloutsos (br0220) 2007; 1 Beame, Koutris, Suciu (br0090) 2013 Frost, Moshkovitz, Rashtchian (br0250) 2020 Chen, Zhu, Liao, Wang, Han, Yang, Lu, Hu, Hu, Wang (br0310) 2024; 20 Yaroslavtsev, Vadapalli (br0140) 2018 Uhříček, Hynek, Čejka, Kolář (br0070) 2023; 10 Frost (br0200) 2023 Shapira, Gat-Viks, Shum, Dricot, de Grace, Wu, Gupta, Hao, Silver, Root (br0260) 2009; 139 Laber, Murtinho, Oliveira (br0080) 2023; 137 Chang, Saranurak (br0180) 2020 Karloff, Suri, Vassilvitskii (br0110) 2010 Niedermeier (br0170) 2006 Dasgupta, Frost, Moshkovitz, Rashtchian (br0030) 2020 Frei, Wada (br0130) 2019 Subhashini, Anand (br0290) 2021 Lo, Kulatilleke, Sarhan, Layeghy, Portmann (br0060) 2023; 22 Leskovec, Krevl (br0210) Jun. 2014 Madani, Averineni, Gandham (br0240) 2022 Pfeifer, Saranti, Holzinger (br0050) 2022; 38 Cygan, Fomin, Kowalik, Lokshtanov, Marx, Pilipczuk, Pilipczuk, Saurabh (br0160) 2015 Kriegel, Kröger, Zimek (br0040) 2008; 1 Marcinkevičs, Vogt (br0010) 2020 Andoni (10.1016/j.ins.2024.120897_br0150) 2018 Hashem (10.1016/j.ins.2024.120897_br0280) 2014; 193 Uhříček (10.1016/j.ins.2024.120897_br0070) 2023; 10 Fish (10.1016/j.ins.2024.120897_br0120) 2015 Chen (10.1016/j.ins.2024.120897_br0310) 2024; 20 Frei (10.1016/j.ins.2024.120897_br0130) 2019 Leskovec (10.1016/j.ins.2024.120897_br0210) Chang (10.1016/j.ins.2024.120897_br0180) 2020 Lo (10.1016/j.ins.2024.120897_br0060) 2023; 22 Holzinger (10.1016/j.ins.2024.120897_br0020) 2022 Ye (10.1016/j.ins.2024.120897_br0300) 2020; 9 Frost (10.1016/j.ins.2024.120897_br0200) Dasgupta (10.1016/j.ins.2024.120897_br0030) 2020 Zenklusen (10.1016/j.ins.2024.120897_br0190) 2019 Beame (10.1016/j.ins.2024.120897_br0090) 2013 Frost (10.1016/j.ins.2024.120897_br0250) Kriegel (10.1016/j.ins.2024.120897_br0040) 2008; 1 Karloff (10.1016/j.ins.2024.120897_br0110) 2010 Beame (10.1016/j.ins.2024.120897_br0100) 2017; 64 Madani (10.1016/j.ins.2024.120897_br0240) 2022 Pfeifer (10.1016/j.ins.2024.120897_br0050) 2022; 38 Niedermeier (10.1016/j.ins.2024.120897_br0170) 2006 Subhashini (10.1016/j.ins.2024.120897_br0290) 2021 Zhou (10.1016/j.ins.2024.120897_br0270) 2023; 102 Yin (10.1016/j.ins.2024.120897_br0230) 2017 Yaroslavtsev (10.1016/j.ins.2024.120897_br0140) 2018 Marcinkevičs (10.1016/j.ins.2024.120897_br0010) Laber (10.1016/j.ins.2024.120897_br0080) 2023; 137 Cygan (10.1016/j.ins.2024.120897_br0160) 2015 Shapira (10.1016/j.ins.2024.120897_br0260) 2009; 139 Leskovec (10.1016/j.ins.2024.120897_br0220) 2007; 1 |
| References_xml | – start-page: 555 year: 2017 end-page: 564 ident: br0230 article-title: Local higher-order graph clustering publication-title: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining – volume: 193 start-page: 722 year: 2014 end-page: 734 ident: br0280 article-title: CD40 ligand preferentially modulates immune response and enhances protection against influenza virus publication-title: J. Immunol. – start-page: 938 year: 2010 end-page: 948 ident: br0110 article-title: A model of computation for mapreduce publication-title: Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms – volume: 137 year: 2023 ident: br0080 article-title: Shallow decision trees for explainable k-means clustering publication-title: Pattern Recognit. – start-page: 100 year: 2022 end-page: 104 ident: br0240 article-title: A dataset of networks of computing hosts publication-title: Proceedings of the 2022 ACM on International Workshop on Security and Privacy Analytics – start-page: 1 year: 2015 end-page: 15 ident: br0120 article-title: On the computational complexity of mapreduce publication-title: Distributed Computing: 29th International Symposium, Proceedings 29 – volume: 10 start-page: 8416 year: 2023 end-page: 8431 ident: br0070 article-title: BOTA: explainable IoT malware detection in large networks publication-title: IEEE Int. Things J. – volume: 1 year: 2007 ident: br0220 article-title: Graph evolution: densification and shrinking diameters publication-title: ACM Trans. Knowl. Discov. Data – year: 2020 ident: br0250 article-title: Exkmc: expanding explainable – year: 2006 ident: br0170 article-title: Invitation to Fixed-Parameter Algorithms, vol. 31 – volume: 22 year: 2023 ident: br0060 article-title: XG-BoT: an explainable deep graph neural network for botnet detection and forensics publication-title: Int. Things – volume: 1 start-page: 1528 year: 2008 end-page: 1529 ident: br0040 article-title: Detecting clusters in moderate-to-high dimensional data: subspace clustering, pattern-based clustering, and correlation clustering publication-title: Proc. VLDB Endow. – start-page: 377 year: 2020 end-page: 388 ident: br0180 article-title: Deterministic distributed expander decomposition and routing with applications in distributed derandomization publication-title: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) – start-page: 13 year: 2022 end-page: 38 ident: br0020 article-title: Explainable ai methods-a brief overview publication-title: International Workshop on Extending Explainable AI Beyond Deep Models and Classifiers – volume: 102 year: 2023 ident: br0270 article-title: Uncovering anti-influenza mechanism of ophiocordyceps sinensis using network pharmacology, molecular pharmacology, and metabolomics publication-title: Medicine – volume: 64 start-page: 40 year: 2017 ident: br0100 article-title: Communication steps for parallel query processing publication-title: J. ACM – start-page: 1 year: 2021 end-page: 6 ident: br0290 article-title: Network biology of KEGG enriched viral comorbidities in psoriasis subjects publication-title: 2021 Innovations in Power and Advanced Computing Technologies (i-PACT) – volume: 20 year: 2024 ident: br0310 article-title: The HN protein of newcastle disease virus induces cell apoptosis through the induction of lysosomal membrane permeabilization publication-title: PLoS Pathog. – year: 2013 ident: br0090 article-title: Communication steps for parallel query processing publication-title: 32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2013 – volume: 139 start-page: 1255 year: 2009 end-page: 1267 ident: br0260 article-title: A physical and regulatory map of host-influenza interactions reveals pathways in H1N1 infection publication-title: Cell – year: 2023 ident: br0200 article-title: ExKMC – start-page: 674 year: 2018 end-page: 685 ident: br0150 article-title: Parallel graph connectivity in log diameter rounds publication-title: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science – year: 2015 ident: br0160 article-title: Parameterized Algorithms, vol. 4 – volume: 38 start-page: ii120 year: 2022 end-page: ii126 ident: br0050 article-title: Gnn-subnet: disease subnetwork detection with explainable graph neural networks publication-title: Bioinformatics – volume: 9 year: 2020 ident: br0300 article-title: Plasmacytoid dendritic cell biology and its role in immune-mediated diseases publication-title: Clin. Transl. Immunol. – start-page: 1539 year: 2019 end-page: 1549 ident: br0190 article-title: A 1.5-approximation for path tsp publication-title: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms – start-page: 12 year: 2020 end-page: 18 ident: br0030 article-title: Explainable k-means and k-medians clustering publication-title: Proceedings of the 37th International Conference on Machine Learning – year: 2018 ident: br0140 article-title: Massively parallel algorithms and hardness for single-linkage clustering under publication-title: Proceedings of the 35th International Conference on Machine Learning – year: 2020 ident: br0010 article-title: Interpretability and explainability: a machine learning zoo mini-tour – year: Jun. 2014 ident: br0210 article-title: SNAP datasets: Stanford large network dataset collection – year: 2019 ident: br0130 article-title: Efficient circuit simulation in mapreduce publication-title: 30th International Symposium on Algorithms and Computation – volume: 1 issue: 1 year: 2007 ident: 10.1016/j.ins.2024.120897_br0220 article-title: Graph evolution: densification and shrinking diameters publication-title: ACM Trans. Knowl. Discov. Data doi: 10.1145/1217299.1217301 – year: 2018 ident: 10.1016/j.ins.2024.120897_br0140 article-title: Massively parallel algorithms and hardness for single-linkage clustering under ℓp-distances – year: 2015 ident: 10.1016/j.ins.2024.120897_br0160 – ident: 10.1016/j.ins.2024.120897_br0250 – start-page: 938 year: 2010 ident: 10.1016/j.ins.2024.120897_br0110 article-title: A model of computation for mapreduce – volume: 38 start-page: ii120 issue: Supplement_2 year: 2022 ident: 10.1016/j.ins.2024.120897_br0050 article-title: Gnn-subnet: disease subnetwork detection with explainable graph neural networks publication-title: Bioinformatics doi: 10.1093/bioinformatics/btac478 – start-page: 100 year: 2022 ident: 10.1016/j.ins.2024.120897_br0240 article-title: A dataset of networks of computing hosts – volume: 139 start-page: 1255 issue: 7 year: 2009 ident: 10.1016/j.ins.2024.120897_br0260 article-title: A physical and regulatory map of host-influenza interactions reveals pathways in H1N1 infection publication-title: Cell doi: 10.1016/j.cell.2009.12.018 – year: 2006 ident: 10.1016/j.ins.2024.120897_br0170 – start-page: 13 year: 2022 ident: 10.1016/j.ins.2024.120897_br0020 article-title: Explainable ai methods-a brief overview – year: 2013 ident: 10.1016/j.ins.2024.120897_br0090 article-title: Communication steps for parallel query processing – ident: 10.1016/j.ins.2024.120897_br0200 – volume: 1 start-page: 1528 issue: 2 year: 2008 ident: 10.1016/j.ins.2024.120897_br0040 article-title: Detecting clusters in moderate-to-high dimensional data: subspace clustering, pattern-based clustering, and correlation clustering publication-title: Proc. VLDB Endow. doi: 10.14778/1454159.1454223 – volume: 137 year: 2023 ident: 10.1016/j.ins.2024.120897_br0080 article-title: Shallow decision trees for explainable k-means clustering publication-title: Pattern Recognit. doi: 10.1016/j.patcog.2022.109239 – start-page: 555 year: 2017 ident: 10.1016/j.ins.2024.120897_br0230 article-title: Local higher-order graph clustering – start-page: 1539 year: 2019 ident: 10.1016/j.ins.2024.120897_br0190 article-title: A 1.5-approximation for path tsp – volume: 193 start-page: 722 issue: 2 year: 2014 ident: 10.1016/j.ins.2024.120897_br0280 article-title: CD40 ligand preferentially modulates immune response and enhances protection against influenza virus publication-title: J. Immunol. doi: 10.4049/jimmunol.1300093 – start-page: 1 year: 2021 ident: 10.1016/j.ins.2024.120897_br0290 article-title: Network biology of KEGG enriched viral comorbidities in psoriasis subjects – year: 2019 ident: 10.1016/j.ins.2024.120897_br0130 article-title: Efficient circuit simulation in mapreduce – start-page: 674 year: 2018 ident: 10.1016/j.ins.2024.120897_br0150 article-title: Parallel graph connectivity in log diameter rounds – volume: 20 issue: 2 year: 2024 ident: 10.1016/j.ins.2024.120897_br0310 article-title: The HN protein of newcastle disease virus induces cell apoptosis through the induction of lysosomal membrane permeabilization publication-title: PLoS Pathog. doi: 10.1371/journal.ppat.1011981 – start-page: 377 year: 2020 ident: 10.1016/j.ins.2024.120897_br0180 article-title: Deterministic distributed expander decomposition and routing with applications in distributed derandomization – volume: 9 issue: 5 year: 2020 ident: 10.1016/j.ins.2024.120897_br0300 article-title: Plasmacytoid dendritic cell biology and its role in immune-mediated diseases publication-title: Clin. Transl. Immunol. doi: 10.1002/cti2.1139 – volume: 102 issue: 35 year: 2023 ident: 10.1016/j.ins.2024.120897_br0270 article-title: Uncovering anti-influenza mechanism of ophiocordyceps sinensis using network pharmacology, molecular pharmacology, and metabolomics publication-title: Medicine doi: 10.1097/MD.0000000000034843 – start-page: 12 year: 2020 ident: 10.1016/j.ins.2024.120897_br0030 article-title: Explainable k-means and k-medians clustering – volume: 22 year: 2023 ident: 10.1016/j.ins.2024.120897_br0060 article-title: XG-BoT: an explainable deep graph neural network for botnet detection and forensics publication-title: Int. Things – volume: 10 start-page: 8416 issue: 10 year: 2023 ident: 10.1016/j.ins.2024.120897_br0070 article-title: BOTA: explainable IoT malware detection in large networks publication-title: IEEE Int. Things J. doi: 10.1109/JIOT.2022.3228816 – volume: 64 start-page: 40 issue: 6 year: 2017 ident: 10.1016/j.ins.2024.120897_br0100 article-title: Communication steps for parallel query processing publication-title: J. ACM doi: 10.1145/3125644 – ident: 10.1016/j.ins.2024.120897_br0210 – ident: 10.1016/j.ins.2024.120897_br0010 – start-page: 1 year: 2015 ident: 10.1016/j.ins.2024.120897_br0120 article-title: On the computational complexity of mapreduce |
| SSID | ssj0004766 |
| Score | 2.4457846 |
| Snippet | Explainable clustering provides human-understandable reasons for decisions in black-box learning models. In a previous work, a decision tree built on the set... |
| SourceID | crossref elsevier |
| SourceType | Index Database Publisher |
| StartPage | 120897 |
| SubjectTerms | DBSCAN Expander graphs Explainable clustering Fixed-parameter algorithms Massively parallel computation |
| Title | Explainable graph clustering via expanders in the massively parallel computation model |
| URI | https://dx.doi.org/10.1016/j.ins.2024.120897 |
| Volume | 677 |
| WOSCitedRecordID | wos001302611500001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 issn: 0020-0255 databaseCode: AIEXJ dateStart: 19950101 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: false ssIdentifier: ssj0004766 providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LS-RAEG5EPewexNWV9bX0QfagRPLoJN3HQdwXKMKqzC10Op11xMnIPMSfb1U_MvGxoAtewpBMJkN9TeWr6q-qCNnLY3CNFfbDq6s6YLVUgYTXUsCjTGteRkJnpRk2kZ-e8n5fnLlRchMzTiBvGn5_L27fFWo4B2Bj6ewb4G5_FE7AZwAdjgA7HF8FPKrqfEmUaUd9oG5m2A4BkwJ3A4lN_W1Ji9c4DoFAg9PDPIcc42yVG6M0nzkhohmW0yWxroTJXHRv0JaZ9_5eySGEy9qoBP5oHEDbZpx_XI2qiblwMoKvDWXVTTrErJW8uUyYr4Z5JNZE6hlgjNL1rpmd0vLMU9ukwTWEF9g0PWaHURxyK9V90gAb95NN6INyVx5hj9elOE8F-LCl3q_j_u95HWxu96b9__C72EbP9-RBL_OQDrc4XyUrLiigPQvmJ7KgmzXysdMqco3sugIT-o12zE-da14nlx3YqYGdzmGnADttYaeDhgLstIWdethpB3ZqYP9MLr4fnx_9DNzMjEBBID0NBBNxVWqk3ZxFTAOhS-o0q3C7WpWhyhXjiQK3W6paaKZllOs0k0mkRK25zJMNstiMGv2FUMEw6yrrNC4l41lWJmEVqirlktVasnCT7HsLFre2NUrhNYPXBZi7QHMX1tybhHkbF25lWs5WwIL4921b_3fbNvkwX7U7ZHE6nuldsqzupoPJ-KtbNg8nDHZd |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Explainable+graph+clustering+via+expanders+in+the+massively+parallel+computation+model&rft.jtitle=Information+sciences&rft.au=Aghamolaei%2C+Sepideh&rft.au=Ghodsi%2C+Mohammad&rft.date=2024-08-01&rft.pub=Elsevier+Inc&rft.issn=0020-0255&rft.volume=677&rft_id=info:doi/10.1016%2Fj.ins.2024.120897&rft.externalDocID=S0020025524008119 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-0255&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-0255&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-0255&client=summon |