iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://api.crossref.org/works/10.15837/IJCCC.2018.5.3238
{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,31]],"date-time":"2024-07-31T11:52:43Z","timestamp":1722426763953},"reference-count":0,"publisher":"Agora University of Oradea","issue":"5","license":[{"start":{"date-parts":[[2018,9,29]],"date-time":"2018-09-29T00:00:00Z","timestamp":1538179200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["INT J COMPUT COMMUN"],"abstract":"Using spectral clustering algorithm is diffcult to find the clusters in the cases that dataset has a large difference in density and its clustering effect depends on the selection of initial centers. To overcome the shortcomings, we propose a novel spectral clustering algorithm based on membrane computing framework, called MSC algorithm, whose idea is to use membrane clustering algorithm to realize the clustering component in spectral clustering. A tissue-like P system is used as its computing framework, where each object in cells denotes a set of cluster centers and velocity-location model is used as the evolution rules. Under the control of evolutioncommunication mechanism, the tissue-like P system can obtain a good clustering partition for each dataset. The proposed spectral clustering algorithm is evaluated on three artiffcial datasets and ten UCI datasets, and it is further compared with classical spectral clustering algorithms. The comparison results demonstrate the advantage of the proposed spectral clustering algorithm.<\/jats:p>","DOI":"10.15837\/ijccc.2018.5.3238","type":"journal-article","created":{"date-parts":[[2018,9,29]],"date-time":"2018-09-29T12:51:41Z","timestamp":1538225501000},"page":"759-771","source":"Crossref","is-referenced-by-count":3,"title":["A Spectral Clustering Algorithm Improved by P Systems"],"prefix":"10.15837","volume":"13","author":[{"given":"Guangchun","family":"Chen","sequence":"first","affiliation":[]},{"given":"Juan","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Hong","family":"Peng","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Xiangnian","family":"Huang","sequence":"additional","affiliation":[]}],"member":"6528","published-online":{"date-parts":[[2018,9,29]]},"container-title":["International Journal of Computers Communications & Control"],"original-title":[],"link":[{"URL":"http:\/\/univagora.ro\/jour\/index.php\/ijccc\/article\/viewFile\/3238\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/univagora.ro\/jour\/index.php\/ijccc\/article\/download\/3238\/1224","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,23]],"date-time":"2021-04-23T07:51:48Z","timestamp":1619164308000},"score":1,"resource":{"primary":{"URL":"http:\/\/univagora.ro\/jour\/index.php\/ijccc\/article\/view\/3238"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,29]]},"references-count":0,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2018,9,29]]}},"URL":"https:\/\/doi.org\/10.15837\/ijccc.2018.5.3238","relation":{},"ISSN":["1841-9836","1841-9836"],"issn-type":[{"value":"1841-9836","type":"electronic"},{"value":"1841-9836","type":"print"}],"subject":[],"published":{"date-parts":[[2018,9,29]]}}}