{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T16:42:35Z","timestamp":1725381755185},"reference-count":54,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Knowledge-Based Systems"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1016\/j.knosys.2019.05.004","type":"journal-article","created":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T13:44:21Z","timestamp":1557323061000},"page":"55-76","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":33,"special_numbering":"C","title":["Graph-based clustering of extracted paraphrases for labelling crime reports"],"prefix":"10.1016","volume":"179","author":[{"given":"Priyanka","family":"Das","sequence":"first","affiliation":[]},{"given":"Asit Kumar","family":"Das","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.knosys.2019.05.004_b1","series-title":"Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing","first-page":"1","article-title":"Monolingual phrase alignment on parse forests","author":"Arase","year":"2017"},{"issue":"6","key":"10.1016\/j.knosys.2019.05.004_b2","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1177\/0165551512459920","article-title":"Terminological paraphrase extraction from scientific literature based on predicate argument tuples","volume":"38","author":"Choi","year":"2012","journal-title":"J. Inf. Sci."},{"issue":"9","key":"10.1016\/j.knosys.2019.05.004_b3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1371\/journal.pone.0074304","article-title":"Metaphor interpretation using paraphrases extracted from the web","volume":"8","author":"Bollegala","year":"2013","journal-title":"PLOS ONE"},{"key":"10.1016\/j.knosys.2019.05.004_b4","series-title":"Proceedings of the Second International Workshop on Paraphrasing, Vol. 16","first-page":"65","article-title":"Paraphrase acquisition for information extraction","author":"Shinyama","year":"2003"},{"key":"10.1016\/j.knosys.2019.05.004_b5","series-title":"Proceedings of the 16th Conference on Computational Linguistics - Volume 1","first-page":"466","article-title":"Message understanding conference-6: A brief history","author":"Grishman","year":"1996"},{"key":"10.1016\/j.knosys.2019.05.004_b6","series-title":"ICTATLL Workshop","article-title":"Exploring newspapers: a case study in corpus analysis","author":"Weir","year":"2007"},{"key":"10.1016\/j.knosys.2019.05.004_b7","series-title":"Third International Conference on Language Resources and Evaluation (LREC-2002)","first-page":"1818","article-title":"Extended named entity hierarchy","author":"Satoshi\u00a0Sekine","year":"2002"},{"key":"10.1016\/j.knosys.2019.05.004_b8","series-title":"WordNet: An Electronic Lexical Database","author":"Fellbaum","year":"1998"},{"key":"10.1016\/j.knosys.2019.05.004_b9","series-title":"Proceedings of the 39th Annual Meeting on Association for Computational Linguistics","first-page":"50","article-title":"Extracting paraphrases from a parallel corpus","author":"Barzilay","year":"2001"},{"key":"10.1016\/j.knosys.2019.05.004_b10","series-title":"Proceedings of the 42Nd Annual Meeting on Association for Computational Linguistics, 415","article-title":"Discovering relations among named entities from large corpora","author":"Hasegawa","year":"2004"},{"key":"10.1016\/j.knosys.2019.05.004_b11","series-title":"11th Annual Meeting of the Japanese Association for Natural Language Processing","article-title":"Unsupervised paraphrase acquisition via relation discovery","author":"Takaaki\u00a0Hasegawa","year":"2005"},{"key":"10.1016\/j.knosys.2019.05.004_b12","series-title":"Proceedings of IWP","first-page":"4","article-title":"Automatic paraphrase discovery based on context and keywords between ne pairs","author":"Sekine","year":"2005"},{"key":"10.1016\/j.knosys.2019.05.004_b13","series-title":"Proceedings of the Human Language Technology Conference of the NAACL","first-page":"133","article-title":"Using phrasal patterns to identify discourse relations","author":"Saito","year":"2006"},{"key":"10.1016\/j.knosys.2019.05.004_b14","series-title":"Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"977","article-title":"Clustering and projected clustering with adaptive neighbors","author":"Nie","year":"2014"},{"issue":"10","key":"10.1016\/j.knosys.2019.05.004_b15","doi-asserted-by":"crossref","first-page":"1709","DOI":"10.1016\/j.camwa.2005.05.009","article-title":"Application of ant k-means on clustering analysis","volume":"50","author":"R.J.\u00a0Kuo","year":"2005","journal-title":"Comput. Math. Appl."},{"key":"10.1016\/j.knosys.2019.05.004_b16","first-page":"849","article-title":"On spectral clustering: Analysis and an algorithm","volume":"14","author":"Ng","year":"2002","journal-title":"Adv. Neural Inf. Process. Syst. (NIPS)"},{"issue":"11","key":"10.1016\/j.knosys.2019.05.004_b17","doi-asserted-by":"crossref","first-page":"1796","DOI":"10.1109\/TNN.2011.2162000","article-title":"Spectral embedded clustering: A framework for in-sample and out-of-sample spectral clustering","volume":"22","author":"Nie","year":"2011","journal-title":"IEEE Trans. Neural Netw."},{"issue":"1","key":"10.1016\/j.knosys.2019.05.004_b18","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1109\/TSMCB.2011.2161607","article-title":"Initialization independent clustering with actively self-training method","volume":"42","author":"Nie","year":"2012","journal-title":"IEEE Trans. Syst. Man Cybern. B"},{"key":"10.1016\/j.knosys.2019.05.004_b19","series-title":"Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence","first-page":"1969","article-title":"The constrained Laplacian rank algorithm for graph-based clustering","author":"Nie","year":"2016"},{"key":"10.1016\/j.knosys.2019.05.004_b20","series-title":"Proceedings 2001 IEEE International Conference on Data Mining","first-page":"107","article-title":"A min-max cut algorithm for graph partitioning and data clustering","author":"Ding","year":"2001"},{"issue":"9","key":"10.1016\/j.knosys.2019.05.004_b21","doi-asserted-by":"crossref","first-page":"1088","DOI":"10.1109\/43.310898","article-title":"Spectral k-way ratio-cut partitioning and clustering","volume":"13","author":"Chan","year":"1994","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."},{"issue":"8","key":"10.1016\/j.knosys.2019.05.004_b22","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1109\/34.868688","article-title":"Normalized cuts and image segmentation","volume":"22","author":"Shi","year":"2000","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.knosys.2019.05.004_b23","series-title":"Machine Learning and Knowledge Discovery in Databases","first-page":"451","article-title":"Improved minmax cut graph clustering with nonnegative relaxation","author":"Nie","year":"2010"},{"key":"10.1016\/j.knosys.2019.05.004_b24","series-title":"EDM","article-title":"Determining review coverage by extracting topic sentences using a graph-based clustering approach","author":"Ramachandran","year":"2013"},{"key":"10.1016\/j.knosys.2019.05.004_b25","series-title":"2016 Conference on Empirical Methods in Natural Language Processing","first-page":"2183","article-title":"POLY: Mining relational paraphrases from multilingual sentences","author":"Grycner","year":"2016"},{"key":"10.1016\/j.knosys.2019.05.004_b26","series-title":"International Workshop on Spoken Language Translation (IWSLT-2010)","first-page":"219","article-title":"An algorithm for cross-lingual sense-clustering tested in a mt evaluation setting","author":"Marianna\u00a0Apidianaki","year":"2010"},{"key":"10.1016\/j.knosys.2019.05.004_b27","series-title":"Proceedings of NAACL-HLT 2016","first-page":"1463","article-title":"Clustering paraphrases by word sense","author":"Anne\u00a0Cocos","year":"2016"},{"key":"10.1016\/j.knosys.2019.05.004_b28","series-title":"12th European Workshop on Natural Language Generation","first-page":"122","article-title":"Clustering and matching headlines for automatic paraphrase acquisition","author":"Sander\u00a0Wubben","year":"2009"},{"key":"10.1016\/j.knosys.2019.05.004_b29","series-title":"Language Resources and Evaluation Conference (LREC)","first-page":"4270","article-title":"Semantic clustering of pivot paraphrases","author":"Apidianaki","year":"2014"},{"key":"10.1016\/j.knosys.2019.05.004_b30","first-page":"38","article-title":"Graph-based clustering of synonym senses for german particle verbs","author":"Wittmann","year":"2016","journal-title":"ACL 2016"},{"key":"10.1016\/j.knosys.2019.05.004_b31","series-title":"IEEE International Conference on Intelligence and Security Informatics (ISI)","first-page":"19","article-title":"Natural language processing based on semantic inferentialism for extracting crime information from text","author":"Pinheiro","year":"2010"},{"key":"10.1016\/j.knosys.2019.05.004_b32","series-title":"Second Australasian Web Conference (AWC 2014), Vol. 155","first-page":"31","article-title":"Extracting crime information from online newspaper articles","author":"Arulanandam","year":"2014"},{"key":"10.1016\/j.knosys.2019.05.004_b33","series-title":"IEEE Conference on Technologies for Homeland Security","first-page":"193","article-title":"Crime information extraction from police and witness narrative reports","author":"Ku","year":"2008"},{"key":"10.1016\/j.knosys.2019.05.004_b34","first-page":"1","article-title":"Feature selection generating directed rough-spanning tree for crime pattern analysis","author":"Das","year":"2018","journal-title":"Neural Comput. Appl."},{"key":"10.1016\/j.knosys.2019.05.004_b35","series-title":"Proceedings of the ACL-02 Workshop on Effective Tools and Methodologies for Teaching Natural Language Processing and Computational Linguistics, Vol. 1","first-page":"63","article-title":"NLTK: The natural language toolkit","author":"Loper","year":"2002"},{"key":"10.1016\/j.knosys.2019.05.004_b36","series-title":"Proceedings of the Second International Joint Conference on Natural Language Processing","first-page":"378","article-title":"Discovering relations between named entities from a large raw corpus using tree similarity-based clustering","author":"Zhang","year":"2005"},{"issue":"2","key":"10.1016\/j.knosys.2019.05.004_b37","doi-asserted-by":"crossref","first-page":"265","DOI":"10.7155\/jgaa.00108","article-title":"Approximating clustering coefficient and transitivity","volume":"9","author":"Schank","year":"2005","journal-title":"J. Graph Algorithms Appl."},{"key":"10.1016\/j.knosys.2019.05.004_b38","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.ins.2018.05.044","article-title":"Sparsity measure of a network graph: Gini index","volume":"462","author":"Goswami","year":"2018","journal-title":"Inform. Sci."},{"issue":"5","key":"10.1016\/j.knosys.2019.05.004_b39","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1007\/s00493-014-2862-4","article-title":"The edge density of critical digraphs","volume":"35","author":"Hoshino","year":"2015","journal-title":"Combinatorica"},{"issue":"3","key":"10.1016\/j.knosys.2019.05.004_b40","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s10888-006-9051-7","article-title":"An extended gini approach to inequality measurement","volume":"5","author":"Moyes","year":"2007","journal-title":"J. Econ, Inequality"},{"issue":"3","key":"10.1016\/j.knosys.2019.05.004_b41","doi-asserted-by":"crossref","DOI":"10.1080\/00220480309595224","article-title":"The lorenz curve and the gini coefficient","volume":"34","author":"Rycroft","year":"2003","journal-title":"J. Econ. Educ."},{"key":"10.1016\/j.knosys.2019.05.004_b42","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1016\/j.knosys.2017.02.013","article-title":"Ensemble feature selection using bi-objective genetic algorithm","volume":"123","author":"Das","year":"2017","journal-title":"Knowl.-Based Syst."},{"issue":"27","key":"10.1016\/j.knosys.2019.05.004_b43","first-page":"1","article-title":"Clustering large datasets using k-means modified inter and intra clustering in hadoop","volume":"4","author":"Sreedhar","year":"2017","journal-title":"J. Big Data"},{"key":"10.1016\/j.knosys.2019.05.004_b44","doi-asserted-by":"crossref","first-page":"780","DOI":"10.1016\/j.procs.2017.12.100","article-title":"A novel heuristic for evolutionary clustering","volume":"125","author":"Nerurkar","year":"2018","journal-title":"Procedia Comput. Sci."},{"issue":"1","key":"10.1016\/j.knosys.2019.05.004_b45","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/j.patcog.2012.07.021","article-title":"An extensive comparative study of cluster validity indices","volume":"46","author":"Arbelaitz","year":"2013","journal-title":"Pattern Recognit."},{"issue":"2","key":"10.1016\/j.knosys.2019.05.004_b46","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1109\/TPAMI.1979.4766909","article-title":"A cluster separation measure","volume":"1","author":"Davies","year":"1979","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"Supplement C","key":"10.1016\/j.knosys.2019.05.004_b47","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0377-0427(87)90125-7","article-title":"Silhouettes: A graphical aid to the interpretation and validation of cluster analysis","volume":"20","author":"Rousseeuw","year":"1987","journal-title":"J. Comput. Appl. Math."},{"issue":"12","key":"10.1016\/j.knosys.2019.05.004_b48","doi-asserted-by":"crossref","first-page":"7821","DOI":"10.1073\/pnas.122653799","article-title":"Community structure in social and biological networks","volume":"99","author":"M.\u00a0Girvan","year":"2002","journal-title":"Proceedings of National Academy of Sciences of the United States of America"},{"issue":"23","key":"10.1016\/j.knosys.2019.05.004_b49","doi-asserted-by":"crossref","first-page":"8577","DOI":"10.1073\/pnas.0601602103","article-title":"Modularity and community structure in networks","volume":"103","author":"Newman","year":"2006","journal-title":"Proc. Nat. Acad. Sci. U.S.A."},{"key":"10.1016\/j.knosys.2019.05.004_b50","first-page":"1","article-title":"Fast unfolding of communities in large networks","author":"Blondel","year":"2008","journal-title":"J. Stat. Mech. Theory Exp."},{"key":"10.1016\/j.knosys.2019.05.004_b51","unstructured":"M. Rosvall, Infomap, 2009,."},{"key":"10.1016\/j.knosys.2019.05.004_b52","doi-asserted-by":"crossref","unstructured":"M. Rosvall, D. Axelsson, C.T. Bergstrom, The map equation, 2009, pp. 13\u201323, http:\/\/dx.doi.org\/10.1140\/epjst\/e2010-01179-1.","DOI":"10.1140\/epjst\/e2010-01179-1"},{"key":"10.1016\/j.knosys.2019.05.004_b53","first-page":"1695","article-title":"The igraph software package for complex network research","volume":"Complex Systems","author":"Csardi","year":"2006","journal-title":"InterJournal"},{"issue":"2","key":"10.1016\/j.knosys.2019.05.004_b54","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1023\/A:1014348124664","article-title":"Gate, a general architecture for text engineering","volume":"36","author":"Cunningham","year":"2002","journal-title":"Comput. Humanit."}],"container-title":["Knowledge-Based Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950705119302114?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950705119302114?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T03:02:31Z","timestamp":1560308551000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0950705119302114"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":54,"alternative-id":["S0950705119302114"],"URL":"https:\/\/doi.org\/10.1016\/j.knosys.2019.05.004","relation":{},"ISSN":["0950-7051"],"issn-type":[{"value":"0950-7051","type":"print"}],"subject":[],"published":{"date-parts":[[2019,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Graph-based clustering of extracted paraphrases for labelling crime reports","name":"articletitle","label":"Article Title"},{"value":"Knowledge-Based Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.knosys.2019.05.004","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}