{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,16]],"date-time":"2024-08-16T13:13:04Z","timestamp":1723813984232},"reference-count":7,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2014]]},"DOI":"10.1587\/transinf.e97.d.1349","type":"journal-article","created":{"date-parts":[[2014,5,1]],"date-time":"2014-05-01T00:12:06Z","timestamp":1398903126000},"page":"1349-1352","source":"Crossref","is-referenced-by-count":3,"title":["Fast Density-Based Clustering Using Graphics Processing Units"],"prefix":"10.1587","volume":"E97.D","author":[{"given":"Woong-Kee","family":"LOH","sequence":"first","affiliation":[{"name":"Department of Multimedia, Sungkyul University"}]},{"given":"Yang-Sae","family":"MOON","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Kangwon National University"}]},{"given":"Young-Ho","family":"PARK","sequence":"additional","affiliation":[{"name":"Department of Multimedia Science, Sookmyung Women's University"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] M. Ankerst, M.M. Breunig, H.-P. Kriegel, and J. Sander, “OPTICS: Ordering points to identify the clustering structure,” Proc. Int'l Conf. Management of Data, ACM SIGMOD, pp.49-60, Philadelphia, Pennsylvania, USA, June 1999.","DOI":"10.1145\/304181.304187"},{"key":"2","unstructured":"[2] C. Böhm, R. Noll, C. Plant, and B. Wackersreuther, “Density-based clustering using graphics processors,” Proc. Conf. Information and knowledge management (CIKM), pp.661-670, Hong Kong, China, Nov. 2009."},{"key":"3","unstructured":"[3] M. Ester, H.-P. Kriegel, J. Sander, and X. Xu, “A density-based algorithm for discovering clusters in large spatial databases with noise,” Proc. Int'l Conf. Knowledge Discovery and Data Mining (KDD), pp.226-231, Portland, Oregon, USA, 1996."},{"key":"4","unstructured":"[4] A. Hinneburg and D.A. Keim, “An efficient approach to clustering in large multimedia databases with noise,” Proc. Int'l Conf. Knowledge Discovery and Data Mining (KDD), pp.58-65, New York, New York, USA, Aug. 1998."},{"key":"5","unstructured":"[5] Nvidia, CUDA C Programming Guide, Ver. 4.2, April 2012."},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] S.A.A. Shalom, M. Dash, and M. Tue, “Efficient K<\/i>-means clustering using accelerated graphics processors,” Proc. Int'l Conf. Warehousing and Knowledge Discovery (DaWaK), pp.166-175, Turin, Italy, Sept. 2008.","DOI":"10.1007\/978-3-540-85836-2_16"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] C. Trapnell and M.C. Schatz, “Optimizing data intensive GPGPU computations for DNA sequence alignment,” Parallel Computing, vol.35, no.8, pp.429-440, Aug. 2009.","DOI":"10.1016\/j.parco.2009.05.002"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E97.D\/5\/E97.D_1349\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,26]],"date-time":"2021-04-26T06:51:52Z","timestamp":1619419912000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E97.D\/5\/E97.D_1349\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"references-count":7,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2014]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.e97.d.1349","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}
