{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T15:35:29Z","timestamp":1781105729959,"version":"3.54.1"},"reference-count":23,"publisher":"IGI Global Scientific Publishing","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,4,1]]},"abstract":"<p>Clustering is fundamental for using big data. However, AP (affinity propagation) is not good at non-convex datasets, and  the input parameter has a marked impact on DBSCAN (density-based spatial clustering of applications with noise). Moreover, new characteristics such as volume, variety, velocity, veracity make it difficult to group big data. To address the issues, a parameter free AP (PFAP) is proposed to group big data on the basis of both distance and density. Firstly, it obtains a group of normalized density from the AP clustering. The estimated parameters are monotonically. Then, the density is used for density clustering for multiple times. Finally, the multiple-density clustering results undergo a two-stage amalgamation to achieve the final clustering result. Experimental results on several benchmark datasets show that PFAP has been achieved better clustering quality than DBSCAN, AP, and APSCAN. And it also has better performance than APSCAN and FSDP.<\/p>","DOI":"10.4018\/ijdwm.2017040104","type":"journal-article","created":{"date-parts":[[2017,5,12]],"date-time":"2017-05-12T06:13:31Z","timestamp":1494569611000},"page":"63-74","source":"Crossref","is-referenced-by-count":1,"title":["Robust Clustering with Distance and Density"],"prefix":"10.4018","volume":"13","author":[{"given":"Hanning","family":"Yuan","sequence":"first","affiliation":[{"name":"School of Software, Beijing Institute of Technology, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shuliang","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Software, Beijing Institute of Technology, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jing","family":"Geng","sequence":"additional","affiliation":[{"name":"Beijing Institute of Technology, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yang","family":"Yu","sequence":"additional","affiliation":[{"name":"Beijing Institute of Technology, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ming","family":"Zhong","sequence":"additional","affiliation":[{"name":"Beijing Institute of Technology, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"IJDWM.2017040104-0","author":"C. C.Aggarwal","year":"2014","journal-title":"Data Clustering: Algorithms and Applications"},{"key":"IJDWM.2017040104-1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2007.04.010"},{"key":"IJDWM.2017040104-2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2011.02.001"},{"key":"IJDWM.2017040104-3","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2007.4408853"},{"key":"IJDWM.2017040104-4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78839-3_31"},{"key":"IJDWM.2017040104-5","first-page":"226","article-title":"A density-based algorithm for discovering clusters in large spatial databases with noise.","author":"M.Ester","year":"1996","journal-title":"Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining"},{"issue":"2","key":"IJDWM.2017040104-6","first-page":"159","article-title":"Research on density-insensitive affinity propagation clustering algorithm.","volume":"38","author":"X.Feng","year":"2012","journal-title":"Computer Engineering"},{"key":"IJDWM.2017040104-7","doi-asserted-by":"publisher","DOI":"10.1126\/science.1136800"},{"key":"IJDWM.2017040104-8","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217303"},{"key":"IJDWM.2017040104-9","unstructured":"Givoni, Ie., & Frey, B. J. (2009). Semi-supervised affinity propagation with instance-level constraints. Proceedings of the 12th International Conference on Artificial Intelligence and Statistics, Florida (pp. 161-168). Microtome."},{"issue":"7","key":"IJDWM.2017040104-10","first-page":"20","article-title":"A fast affinity propagation clustering algorithm.","volume":"41","author":"X.Liu","year":"2011","journal-title":"Journal of Shandong University"},{"key":"IJDWM.2017040104-11","doi-asserted-by":"publisher","DOI":"10.1126\/science.1242072"},{"key":"IJDWM.2017040104-12","doi-asserted-by":"publisher","DOI":"10.1109\/ACV.1994.341300"},{"key":"IJDWM.2017040104-13","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2009.2025923"},{"key":"IJDWM.2017040104-14","article-title":"Introduction to Information Retrieval.","author":"H.Sch\u00fctze","year":"2008","journal-title":"Proceedings of the international communication of association for computing machinery conference"},{"key":"IJDWM.2017040104-15","doi-asserted-by":"publisher","DOI":"10.1038\/518480a"},{"key":"IJDWM.2017040104-16","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2002.1033218"},{"issue":"7","key":"IJDWM.2017040104-17","first-page":"207","article-title":"Fast algorithm of affinity propagation clustering under given number of clusters.","volume":"19","author":"K.Wang","year":"2010","journal-title":"Computer Systems Applications"},{"key":"IJDWM.2017040104-18","doi-asserted-by":"publisher","DOI":"10.4018\/jdwm.2011100103"},{"key":"IJDWM.2017040104-19","doi-asserted-by":"publisher","DOI":"10.1631\/jzus.C1100176"},{"key":"IJDWM.2017040104-20","first-page":"2238","article-title":"Fast algorithm for affinity propagation.","author":"F.Yasuhiro","year":"2011","journal-title":"Proceedings of the 22nd International Joint Conference on Artificial Intelligence"},{"key":"IJDWM.2017040104-21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49586-6_34"},{"key":"IJDWM.2017040104-22","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1971.223083"}],"container-title":["International Journal of Data Warehousing and Mining"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=181884","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,6]],"date-time":"2022-05-06T14:12:32Z","timestamp":1651846352000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/IJDWM.2017040104"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2017,4,1]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,4]]}},"URL":"https:\/\/doi.org\/10.4018\/ijdwm.2017040104","relation":{},"ISSN":["1548-3924","1548-3932"],"issn-type":[{"value":"1548-3924","type":"print"},{"value":"1548-3932","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4,1]]}}}