{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T19:55:39Z","timestamp":1760385339390},"reference-count":98,"publisher":"IGI Global","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,4,1]]},"abstract":"<p>This article is a survey into clustering applications and algorithms. A number of important well-known clustering methods are discussed. The authors present a brief history of the development of the field of clustering, discuss various types of clustering, and mention some of the current research directions in the field of clustering. More specifically, top-down and bottom-up hierarchical clustering are described. Additionally, K-Means and K-Medians clustering algorithms are also shown. The concept of representative points is introduced and the technique of discovering them is presented. Immense data sets in clustering often necessitate parallel computation. The authors discuss issues involving parallel clustering as well. Clustering deals with a large number of experimental results. The authors provide references to these works throughout the article. A table for comparing various clustering methods is given in the end. The authors give a summary and an extensive list of references, including some of the latest works in the field, to conclude the article.<\/p>","DOI":"10.4018\/ijirr.2013040101","type":"journal-article","created":{"date-parts":[[2014,1,23]],"date-time":"2014-01-23T16:51:02Z","timestamp":1390495862000},"page":"1-29","source":"Crossref","is-referenced-by-count":8,"title":["Survey of Clustering"],"prefix":"10.4018","volume":"3","author":[{"given":"Raymond","family":"Greenlaw","sequence":"first","affiliation":[{"name":"The United States Naval Academy, Annapolis, MD, USA"}]},{"given":"Sanpawat","family":"Kantabutra","sequence":"additional","affiliation":[{"name":"The Theory of Computation Group, Department of Computer Engineering, Chiang Mai University, Chiang Mai, Thailand"}]}],"member":"2432","reference":[{"key":"ijirr.2013040101-0","doi-asserted-by":"crossref","unstructured":"Ackermann, M. R., Martens, M., Raupach, C., Swierkot, K., Lammersen, C., & Sohler, C. (2012). StreamKM++: A clustering algorithm for data streams. ACM Journal of Experimental Algorithmics, 17(2), 2.4:1-2.4:30.","DOI":"10.1145\/2133803.2184450"},{"key":"ijirr.2013040101-1","doi-asserted-by":"publisher","DOI":"10.1145\/335191.335383"},{"key":"ijirr.2013040101-2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Gehrke, J., Gunopulos, D., & Raghavan, P. (1998). Automatic subspace clustering of high dimensional data for data mining applications. In Proceedings of the ACM SIGMOD Conference, Seattle, WA (pp. 94-105).","DOI":"10.1145\/276305.276314"},{"key":"ijirr.2013040101-3","doi-asserted-by":"publisher","DOI":"10.1016\/0031-3203(95)00022-R"},{"key":"ijirr.2013040101-4","doi-asserted-by":"crossref","unstructured":"Amini, A., Wah, T. Y., Saybani, M. R., & Yazdi, S. R. A. S. (2011). A study of density-grid based clustering algorithms on data streams. In Proceedings of the Eighth International Conference on Fuzzy Systems and Knowledge Discovery, Shanghai, China (pp. 1652-1656).","DOI":"10.1109\/FSKD.2011.6019867"},{"key":"ijirr.2013040101-5","doi-asserted-by":"crossref","unstructured":"Ankerst, M., Breunig, M., Kriegel, H.-P., & Sander, J. (1999). OPTICS: Ordering points to identify clustering structure. In Proceedings of the ACM SIGMOD Conference, Philadelphia, PA (pp. 49-60).","DOI":"10.1145\/304181.304187"},{"key":"ijirr.2013040101-6","doi-asserted-by":"crossref","unstructured":"Arora, S., Raghavan, P., & Rao, S. (1998). Approximation schemes for Euclidean k-medians and related problems. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, Dallas, TX (pp. 106-113).","DOI":"10.1145\/276698.276718"},{"key":"ijirr.2013040101-7","doi-asserted-by":"crossref","unstructured":"Babcock, B., Datar, M., Motwani, R., & O\u2032Callaghan, L. (2003). Maintaining variance and k-medians over data stream windows. In Proceedings of the 22nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, San Diego, CA (pp. 234-243).","DOI":"10.1145\/773153.773176"},{"key":"ijirr.2013040101-8","doi-asserted-by":"crossref","unstructured":"Bandyopadhyay, S., & Coyle, E. J. (2003). An energy efficient hierarchical clustering algorithm for wireless sensor networks. In Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, San Francisco, CA.","DOI":"10.1109\/INFCOM.2003.1209194"},{"key":"ijirr.2013040101-9","author":"P.Berkhin","year":"2002","journal-title":"Survey of clustering data mining techniques"},{"key":"ijirr.2013040101-10","doi-asserted-by":"crossref","unstructured":"Beyer, K., Goldstein, J., Ramakrishnan, R., & Shaft, U. (1999). When is nearest neighbor meaningful? In Proceedings of the 7th ICDT Conference, Jerusalem, Israel.","DOI":"10.1007\/3-540-49257-7_15"},{"issue":"1","key":"ijirr.2013040101-11","article-title":"Visual interactive evolutionary algorithm for high dimensional outlier detection and data clustering problems. Int.","volume":"4","author":"L.Boudjeloud-Assala","year":"2012","journal-title":"J. Bio-Inspired Computation"},{"key":"ijirr.2013040101-12","unstructured":"Bradley, P. S., & Fayyad, U. M. (1998). Refining initial points for k-means clustering. In Proceedings of the 15th International Conference on Machine Learning, Madison, WI (pp. 91-99)."},{"key":"ijirr.2013040101-13","author":"P. S.Bradley","year":"1998","journal-title":"Scaling clustering algorithms to large databases"},{"key":"ijirr.2013040101-14","unstructured":"Brown, D., & Huntley, C. (1991). A practical application of simulated annealing to clustering. Technical Report IPC-TR-91-003, University of Virginia."},{"key":"ijirr.2013040101-15","first-page":"1","author":"P.B\u00fchlmann","year":"2006","journal-title":"Boosting and l1-penalty methods for high-dimensional data with some applications in genomics. From Data and Information Analysis to Knowledge Engineering"},{"key":"ijirr.2013040101-16","doi-asserted-by":"crossref","unstructured":"Charikar, M., Guha, S., Tardos, E., & Shmoys, D. B. (1999). A constant-factor approximation algorithm for the k-medians problem. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing, Atlanta, GA (pp. 1-10).","DOI":"10.1145\/301250.301257"},{"key":"ijirr.2013040101-17","author":"P.Cheeseman","year":"1996","journal-title":"Bayesian classification (AutoClass): Theory and results. Advances in Knowledge Discovery and Data Mining"},{"key":"ijirr.2013040101-18","doi-asserted-by":"crossref","unstructured":"Cheng, C., Fu, A., & Zhang, Y. (1999). Entropy-based subspace clustering for mining numerical data. In Proceedings of the 5th ACM SIGKDD Conference, San Diego, CA (pp. 84-93).","DOI":"10.1145\/312129.312199"},{"key":"ijirr.2013040101-19","doi-asserted-by":"publisher","DOI":"10.1109\/72.363440"},{"key":"ijirr.2013040101-20","author":"T. H.Cormen","year":"1990","journal-title":"Introduction to algorithms"},{"key":"ijirr.2013040101-21","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/16.22.10881"},{"key":"ijirr.2013040101-22","unstructured":"Cristofor, D., & Simovici, D. A. (2002). An information-theoretical approach to clustering categorical databases using genetic algorithms. In Proceedings of the 2nd SIAM ICDM Conference, Arlington, VA."},{"key":"ijirr.2013040101-23","doi-asserted-by":"crossref","unstructured":"Cula, O. G., & Dana, K. J. (2001). Compact representation of bidirectional texture functions. In Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition.","DOI":"10.1109\/CVPR.2001.990645"},{"key":"ijirr.2013040101-24","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/20.4.364"},{"key":"ijirr.2013040101-25","doi-asserted-by":"publisher","DOI":"10.1016\/S0924-2716(01)00027-2"},{"key":"ijirr.2013040101-26","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144599352836"},{"key":"ijirr.2013040101-27","doi-asserted-by":"publisher","DOI":"10.1142\/9789812384737_0001"},{"key":"ijirr.2013040101-28","doi-asserted-by":"crossref","unstructured":"Ertoz, L., Steinbach, M., & Kumar, V. (2003). Finding clusters of different sizes, shapes, and densities in noisy, high dimensional data. In Proceedings of the 3rd SIAM International Conference on Data Mining, San Francisco, CA.","DOI":"10.1137\/1.9781611972733.5"},{"key":"ijirr.2013040101-29","unstructured":"Ester, M., Kriegel, H.-P., Sander, J., & Xu, X. (1996). A density-based algorithm for discovering clusters in large spatial databases with noise. In Proceedings of the 2nd ACM SIGKDD Conference, Portland, OR (pp. 226-231)."},{"key":"ijirr.2013040101-30","author":"B.Everitt","year":"1993","journal-title":"Cluster analysis"},{"key":"ijirr.2013040101-31","unstructured":"Fasulo, D. (1999). An analysis of recent work on clustering algorithms. Technical Report UW-CSE01-03-02. University of Washington."},{"key":"ijirr.2013040101-32","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2006.10.034"},{"key":"ijirr.2013040101-33","doi-asserted-by":"publisher","DOI":"10.1002\/spe.829"},{"key":"ijirr.2013040101-34","unstructured":"Fich, F. E. (1993). The complexity of computation on the parallel random access machine. In J. H. Reif (Ed.), Proceedings of the Synthesis of Parallel Algorithms (chap. 20, pp. 843-899). Morgan Kaufmann."},{"key":"ijirr.2013040101-35","doi-asserted-by":"crossref","unstructured":"Fraley, C., & Raftery, A. (1999). MCLUST: Software for model-based cluster and discriminant analysis. Technical Report 342, Department of Statistics, University of Washington.","DOI":"10.1007\/s003579900058"},{"key":"ijirr.2013040101-36","doi-asserted-by":"crossref","unstructured":"Ganti, V., Gehrke, J., & Ramakrishnan, R. (1999). CACTUS-clustering categorical data using summaries. In Proceedings of the 5th ACM SIGKDD Conference, San Diego, CA (pp. 73-83).","DOI":"10.1145\/312129.312201"},{"key":"ijirr.2013040101-37","doi-asserted-by":"publisher","DOI":"10.1186\/gb-2002-3-11-research0059"},{"key":"ijirr.2013040101-38","author":"J.Ghosh","year":"2002","journal-title":"Scalable clustering methods for data mining. Handbook of data mining"},{"key":"ijirr.2013040101-39","unstructured":"Gibson, D., Kleinberg, J., & Raghavan, P. (1998). Clustering categorical data: An approach based on dynamic systems. In Proceedings of the 24th International Conference on Very Large Databases, New York, NY (pp. 311-323)."},{"key":"ijirr.2013040101-40","unstructured":"Goil, S., Nagesh, H., & Choudhary, A. (1999). MAFIA: Efficient and scalable subspace clustering for very large data sets. Technical Report CPDC-TR-9906-010, Northwestern University, USA."},{"key":"ijirr.2013040101-41","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2010.09.013"},{"key":"ijirr.2013040101-42","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-011-0041-0"},{"key":"ijirr.2013040101-43","doi-asserted-by":"crossref","unstructured":"Graham, D. B., & Allinson, N. M. (1998). Automatic face representation and classification. Proceedings of British Machine Vision Conference, Southampton, UK.","DOI":"10.5244\/C.12.7"},{"key":"ijirr.2013040101-44","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195085914.001.0001","author":"R.Greenlaw","year":"1995","journal-title":"Limits to parallel: P-completeness theory"},{"key":"ijirr.2013040101-45","doi-asserted-by":"publisher","DOI":"10.1002\/cplx.20238"},{"key":"ijirr.2013040101-46","doi-asserted-by":"crossref","unstructured":"Guha, S., Rastogi, R., & Shim, K. (1998). CURE: An efficient clustering algorithm for large databases. In Proceedings of the ACM SIGMOD Conference, Seattle, WA (pp. 73-84).","DOI":"10.1145\/276305.276312"},{"key":"ijirr.2013040101-47","doi-asserted-by":"crossref","unstructured":"Guha, S., Rastogi, R., & Shim, K. (1999). ROCK: A robust clustering algorithm for categorical attributes. In Proceedings of the 15th ICDE Conference, Sydney, Australia (pp. 512-521).","DOI":"10.1109\/ICDE.1999.754967"},{"key":"ijirr.2013040101-48","doi-asserted-by":"crossref","unstructured":"Gutkin, A., & King, S. (2004). Structural representation of speech for phonetic classification. In Proceedings of the 17th International Conference on Pattern Recognition, Cambridge, UK.","DOI":"10.1109\/ICPR.2004.1334560"},{"key":"ijirr.2013040101-49","unstructured":"Hall, D. J., & Ball, G. B. (1965). ISODATA: A novel method of data analysis and pattern classification. Technical Report AD-699616, Stanford Research Institute, Menlo Park, CA."},{"key":"ijirr.2013040101-50","doi-asserted-by":"publisher","DOI":"10.1109\/4235.771164"},{"key":"ijirr.2013040101-51","doi-asserted-by":"crossref","unstructured":"Han, J., Kamber, M., & Tung, A. K. H. (2001). Spatial clustering methods in data mining: A survey. Geographic data mining and knowledge discovery. Taylor and Francis.","DOI":"10.4324\/9780203468029_chapter_8"},{"key":"ijirr.2013040101-52","author":"J.Hartigan","year":"1975","journal-title":"Clustering algorithms"},{"key":"ijirr.2013040101-53","unstructured":"Hinneburg, A., & Keim, D. (1998). An efficient approach to clustering large multimedia databases with noise. In Proceedings of the 4th ACM SIGKDD Conference, New York, NY (pp. 58-65)."},{"key":"ijirr.2013040101-54","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.268"},{"key":"ijirr.2013040101-55","author":"A.Jain","year":"1988","journal-title":"Algorithms for clustering data"},{"key":"ijirr.2013040101-56","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2009.09.011"},{"key":"ijirr.2013040101-57","doi-asserted-by":"publisher","DOI":"10.1145\/331499.331504"},{"key":"ijirr.2013040101-58","doi-asserted-by":"crossref","unstructured":"Jain, P., Mekaa, R., & Dhillon, I. S. (2008). Simultaneous unsupervised learning of disparate clusterings. In Proceedings of the SIAM International Conference on Data Mining, Atlanta, GA.","DOI":"10.1137\/1.9781611972788.77"},{"key":"ijirr.2013040101-59","doi-asserted-by":"crossref","unstructured":"Kannan, R., Vempala, S., & Vetta, A. (2000). On clusterings: Good, bad, and spectral. In Proceedings of the 41st Foundations of Computer Science, Redondo Beach, CA.","DOI":"10.1109\/SFCS.2000.892125"},{"key":"ijirr.2013040101-60","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.11.063"},{"key":"ijirr.2013040101-61","unstructured":"Kantabutra, S. (2001). Efficient representation of cluster structure in large data sets. Ph.D. Dissertation, Tufts University, Medford, MA."},{"key":"ijirr.2013040101-62","unstructured":"Kantabutra, S., & Couch, A. (2000). Parallel k-means clustering algorithm on NOWs. NECTEC Technical Journal, 1(6)."},{"key":"ijirr.2013040101-63","doi-asserted-by":"publisher","DOI":"10.1109\/2.781637"},{"key":"ijirr.2013040101-64","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316801"},{"key":"ijirr.2013040101-65","doi-asserted-by":"crossref","unstructured":"Kim, S., Jin, X., & Han, J. (2008). SpaRClus: Spatial relationship pattern-based hierarchical clustering. In Proceedings of the SIAM International Conference on Data Mining, Atlanta, GA.","DOI":"10.1137\/1.9781611972788.5"},{"key":"ijirr.2013040101-66","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56927-2","author":"T.Kohonen","year":"2001","journal-title":"Self-organizing maps. Springer Series in Information Sciences, 30"},{"key":"ijirr.2013040101-67","article-title":"Clustering algorithms for spatial databases","author":"E.Kolatch","year":"2001","journal-title":"Survey (London, England)"},{"key":"ijirr.2013040101-68","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2003.12.002"},{"key":"ijirr.2013040101-69","doi-asserted-by":"publisher","DOI":"10.1023\/B:JIIS.0000029668.88665.1a"},{"key":"ijirr.2013040101-70","author":"S.Lloyd","year":"1957","journal-title":"Least square quantization in PCM\u2019s"},{"key":"ijirr.2013040101-71","unstructured":"MacQueen, J. (1967). Some methods for classification and analysis of multivariate observations. In Proceedings of the Fifth Berkeley Symposium On Mathematical Statistics and Probability (Vol. 1, pp. 281-296)."},{"key":"ijirr.2013040101-72","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0457-9"},{"key":"ijirr.2013040101-73","doi-asserted-by":"publisher","DOI":"10.1089\/dna.2004.23.615"},{"key":"ijirr.2013040101-74","doi-asserted-by":"crossref","unstructured":"Muller, E., Gunnemann, S., Farber, I., & Seidl, T. (2012). Discovering multiple clustering solutions: Grouping objects in different views of the data. In Proceedings of the 2012 IEEE 28th International Conference on Data Engineering, Virginia.","DOI":"10.1109\/ICDE.2012.142"},{"key":"ijirr.2013040101-75","doi-asserted-by":"crossref","unstructured":"Nagesh, H., Goil, S., & Choudhary, A. (2001). Adaptive grids for clustering massive data sets. In Proceedings of the 1st SIAM ICDM Conference, Chicago, IL.","DOI":"10.1137\/1.9781611972719.7"},{"key":"ijirr.2013040101-76","unstructured":"Peeters, G., Burthe, A. L., & Rodet, X. (2002). Toward automatic music audio summary generation from signal analysis. In Proceedings of the International Conference on Music Information Retrieval, Paris, France."},{"key":"ijirr.2013040101-77","doi-asserted-by":"crossref","unstructured":"Ratha, N. K., Jain, A. K., & Chung, M. J. (1995). Clustering using a coarse-grained parallel genetic algorithm. In Proceedings of the IEEE Computer Architectures for Machine Perception (pp. 331-338).","DOI":"10.1109\/CAMP.1995.521057"},{"key":"ijirr.2013040101-78","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009745219419"},{"key":"ijirr.2013040101-79","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/16.1.30"},{"key":"ijirr.2013040101-80","author":"H.Spath","year":"1980","journal-title":"Cluster analysis algorithms"},{"key":"ijirr.2013040101-81","unstructured":"Steinbach, M., Karypis, G., & Kumar, V. (2000). A comparison of document clustering techniques. In Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Boston, MA."},{"key":"ijirr.2013040101-82","first-page":"801","article-title":"Sur la division des corp materiels en parties.","volume":"IV","author":"H.Steinhaus","year":"1956","journal-title":"Bull. Acad. Polon. Sci."},{"key":"ijirr.2013040101-83","unstructured":"Tsai, H., Horng, S., Tsai, S., Lee, S., Kao, T., & Chen, C. (1997). Parallel clustering algorithms on a reconfigurable array of processors with wider bus networks. In Proceedings of the IEEE International Conference on Parallel and Distributed Systems."},{"key":"ijirr.2013040101-84","doi-asserted-by":"publisher","DOI":"10.3844\/jcssp.2010.363.368"},{"key":"ijirr.2013040101-85","doi-asserted-by":"crossref","unstructured":"Vittayakorn, S., Kantabutra, S., & Tanprasert, C. (2008, May 9-12). The parallel complexities of the k-medians related problems. In Proceedings of the 5th International Conference on Electrical Engineering\/Electronics, Computer, Telecommunications and Information Technology, Krabi, Thailand.","DOI":"10.1109\/ECTICON.2008.4600360"},{"key":"ijirr.2013040101-86","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4573(86)90097-X"},{"key":"ijirr.2013040101-87","unstructured":"Wallace, C., & Dowe, D. (1994). Intrinsic classification by MML \u2013 The snob program. In Proceedings of the 7th Australian Joint Conference on Artificial Intelligence, Armidale, Australia (pp. 37-44)."},{"key":"ijirr.2013040101-88","doi-asserted-by":"publisher","DOI":"10.1145\/45054.45056"},{"key":"ijirr.2013040101-89","unstructured":"Wang, F., & Zhang, Q. J. (1995). An improved k-means clustering algorithm and application to combined multicodebook\/MLP neural network speech recognition. In Proceedings of the IEEE Canadian Conference on Electrical and Computer Engineering (Vol. 2, 999-1002)."},{"key":"ijirr.2013040101-90","unstructured":"Wang, W., Yang, J., & Muntz, R. (1997). STING: A statistical information grid approach to spatial data mining. In Proceedings of the 23rd Conference on VLDB, Athens, Greece (pp. 186-195)."},{"key":"ijirr.2013040101-91","doi-asserted-by":"publisher","DOI":"10.1006\/taap.2001.9243"},{"key":"ijirr.2013040101-92","doi-asserted-by":"publisher","DOI":"10.1086\/170483"},{"key":"ijirr.2013040101-93","author":"B.Wilkinson","year":"1998","journal-title":"Parallel programming, techniques and applications using networked workstations and parallel computers"},{"key":"ijirr.2013040101-94","unstructured":"Xu, X., Ester, M., Kriegel, H.-P., & Sander, J. (1998). A distribution-based clustering algorithm for mining in large spatial databases. In Proceedings of the 14th ICDE Conference, Orlando, FL (pp. 324-331)."},{"key":"ijirr.2013040101-95","unstructured":"Young, N. E. (2000). Greedy approximation algorithm for k-medians by randomized rounding. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA."},{"key":"ijirr.2013040101-96","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009783824328"},{"key":"ijirr.2013040101-97","doi-asserted-by":"publisher","DOI":"10.5813\/www.ieit-web.org\/IJADC\/2012.1.3"}],"container-title":["International Journal of Information Retrieval Research"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=100038","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T17:33:09Z","timestamp":1654104789000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/ijirr.2013040101"}},"subtitle":["Algorithms and Applications"],"short-title":[],"issued":{"date-parts":[[2013,4,1]]},"references-count":98,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,4]]}},"URL":"https:\/\/doi.org\/10.4018\/ijirr.2013040101","relation":{},"ISSN":["2155-6377","2155-6385"],"issn-type":[{"value":"2155-6377","type":"print"},{"value":"2155-6385","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,1]]}}}