On the parallel complexity of minimum sum of diameters clustering
Given a set of n entities to be classified, and a matric of dissimilarities between pairs of them. This paper considers the problem called Minimum Sum of Diameters Clustering Problem, where a partition of the set of entities into k clusters such that the sum of the diameters of these clusters is min...
Gespeichert in:
| Veröffentlicht in: | 2015 International Computer Science and Engineering Conference (ICSEC) S. 1 - 6 |
|---|---|
| Hauptverfasser: | , |
| Format: | Tagungsbericht |
| Sprache: | Englisch |
| Veröffentlicht: |
IEEE
01.11.2015
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | Given a set of n entities to be classified, and a matric of dissimilarities between pairs of them. This paper considers the problem called Minimum Sum of Diameters Clustering Problem, where a partition of the set of entities into k clusters such that the sum of the diameters of these clusters is minimized. Brucker showed that the complexity of the problem is NP-hard, when k ≥ 3 [1]. For the case of k = 2, Hansen and Jaumard gave an O(n 3 log n) algorithm [2], which Ramnath later improved the running time to O(n 3 ) [3]. This paper discusses the parallel complexity of the Minimum Sum of Diameters Clustering Problem. For the case of k = 2, we show that the problem in parallel in fact belongs in class NC 1 In particular, we show that the parallel complexity of the problem is O(log n) parallel time and n 7 processors on the Common CRCW PRAM model. Additionally, we propose the parallel algorithmic technique which can be applied to improve the processor bound by a factor of n. As a result, we show that the problem can be quickly solved in O(log n) parallel time using n 6 processors on the Common CRCW PRAM model. In addition, regarding the issue of high processor complexity, we also propose a more practical NC algorithm which can be implemented in O(log 3 n) parallel time using n 3.376 processors on the EREW PRAM model. |
|---|---|
| AbstractList | Given a set of n entities to be classified, and a matric of dissimilarities between pairs of them. This paper considers the problem called Minimum Sum of Diameters Clustering Problem, where a partition of the set of entities into k clusters such that the sum of the diameters of these clusters is minimized. Brucker showed that the complexity of the problem is NP-hard, when k ≥ 3 [1]. For the case of k = 2, Hansen and Jaumard gave an O(n 3 log n) algorithm [2], which Ramnath later improved the running time to O(n 3 ) [3]. This paper discusses the parallel complexity of the Minimum Sum of Diameters Clustering Problem. For the case of k = 2, we show that the problem in parallel in fact belongs in class NC 1 In particular, we show that the parallel complexity of the problem is O(log n) parallel time and n 7 processors on the Common CRCW PRAM model. Additionally, we propose the parallel algorithmic technique which can be applied to improve the processor bound by a factor of n. As a result, we show that the problem can be quickly solved in O(log n) parallel time using n 6 processors on the Common CRCW PRAM model. In addition, regarding the issue of high processor complexity, we also propose a more practical NC algorithm which can be implemented in O(log 3 n) parallel time using n 3.376 processors on the EREW PRAM model. |
| Author | Kantabutra, Sanpawat Juneam, Nopadon |
| Author_xml | – sequence: 1 givenname: Nopadon surname: Juneam fullname: Juneam, Nopadon email: juneam.n@gmail.com organization: Dept. of Comput. Sci., Chiang Mai Univ., Chiang Mai, Thailand – sequence: 2 givenname: Sanpawat surname: Kantabutra fullname: Kantabutra, Sanpawat email: sanpawat.k@gmail.com organization: Theor. of Comput. Group, Chiang Mai Univ., Chiang Mai, Thailand |
| BookMark | eNotj89Kw0AYxFfQg619Ab3sCyTu_3w5llC1UOih9lx20291YXcTkhTs2xuxh2HmB8PALMh97jIS8sxZyTmrX7fNYdOUgnFdVopxxfUdWXBlKlmB0PUjWe8znb6R9nawMWKkbZf6iD9hutLO0xRySJdEx1kznoNNOOEw0jZexjmE_PVEHryNI65uviTHt81n81Hs9u_bZr0rAhdyKlSLCByEcxqkNepcG8cMOP6HoI1izujKG-UAHMwlqFAorGtvGGjp5ZK8_O8GRDz1Q0h2uJ5ur-Qv1x9GDA |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/ICSEC.2015.7401415 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| EISBN | 1467378259 9781467378253 |
| EndPage | 6 |
| ExternalDocumentID | 7401415 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IL CBEJK RIE RIL |
| ID | FETCH-LOGICAL-i123t-4cee8182bb583a64d96b068b1583a85640b657f64b88b8b5887e24e99f60853f3 |
| IEDL.DBID | RIE |
| IngestDate | Thu Jun 29 18:35:57 EDT 2023 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i123t-4cee8182bb583a64d96b068b1583a85640b657f64b88b8b5887e24e99f60853f3 |
| PageCount | 6 |
| ParticipantIDs | ieee_primary_7401415 |
| PublicationCentury | 2000 |
| PublicationDate | 20151101 |
| PublicationDateYYYYMMDD | 2015-11-01 |
| PublicationDate_xml | – month: 11 year: 2015 text: 20151101 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | 2015 International Computer Science and Engineering Conference (ICSEC) |
| PublicationTitleAbbrev | ICSEC |
| PublicationYear | 2015 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| Score | 1.576624 |
| Snippet | Given a set of n entities to be classified, and a matric of dissimilarities between pairs of them. This paper considers the problem called Minimum Sum of... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 1 |
| SubjectTerms | application in social networking clustering Clustering algorithms Complexity theory Computational modeling minimum sum of diameters Parallel algorithms parallel complexity Phase change random access memory PRAM algorithm Program processors Social network services |
| Title | On the parallel complexity of minimum sum of diameters clustering |
| URI | https://ieeexplore.ieee.org/document/7401415 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEB5q8eBJpRXf5ODRtPvI8yhLi4LUggq9lc3uBArtVtpu8eebpGtF8OItE_IgmcA3SeabAbjTJomFzhOal6mgjBtLldWKWmkx1rl2kBmIws9yNFKTiR634H7PhUHE4HyGPV8Mf_nlsqj9U1nfZ48LjPIDKeWOq_XNg4l0_yl7HWTeWYv3moa_MqYEwBge_2-qE-j-MO_IeI8pp9DCqgMPLxVxdhrxYbrdNX9Ogh84fjoDmiwt8dFBFvWCuDPlRafwhfdxWZNiXvswCG6gLrwPB2_ZI21SH9CZg5INZW4eB6WJMVyluWClFiYSysReVFywyAgurWBGKaNcIyUxYai1Fc6GSm16Bu1qWeE5kDSP41JHGBuWMNdFc-TaypQVBZMo1QV0_PKnH7voFtNm5Zd_V1_Bkd_hHRvvGtqbVY03cFhsN7P16jao5AuUb45W |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LawIxEB7EFtpTW7T03Rx6bHSzm-exiKLUWqEWvMlmNwFBV1G39Oc3idZS6KW3TMiDZALfJJlvBuBB6ZhwlcY4zROOKdMWS6sktsIaolLlIDMQhftiMJDjsRpW4HHPhTHGBOcz0_DF8JefL7LSP5U1ffa4wCg_YJTGZMvW-mbCRKrZa721W95dizV2TX_lTAmQ0Tn532SnUP_h3qHhHlXOoGKKGjy9FshZasgH6nYX_RkKnuDm05nQaGGRjw8yL-fInSovOpXPvZfLGmWz0gdCcAPV4b3THrW6eJf8AE8dmGwwdfM4MI21ZjJJOc0V1xGXmnhRMk4jzZmwnGoptXSNpDAxNUpZ7qyoxCbnUC0WhbkAlKSE5CoyRNOYui6KGaasSGiWUWGEvISaX_5kuY1vMdmt_Orv6ns46o5e-pN-b_B8Dcd-t7fcvBuoblaluYXD7GMzXa_ugnq-AC3WkZ0 |
| 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%3Abook&rft.genre=proceeding&rft.title=2015+International+Computer+Science+and+Engineering+Conference+%28ICSEC%29&rft.atitle=On+the+parallel+complexity+of+minimum+sum+of+diameters+clustering&rft.au=Juneam%2C+Nopadon&rft.au=Kantabutra%2C+Sanpawat&rft.date=2015-11-01&rft.pub=IEEE&rft.spage=1&rft.epage=6&rft_id=info:doi/10.1109%2FICSEC.2015.7401415&rft.externalDocID=7401415 |