{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,25]],"date-time":"2024-07-25T21:55:53Z","timestamp":1721944553703},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2018,11,20]],"date-time":"2018-11-20T00:00:00Z","timestamp":1542672000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,11,20]],"date-time":"2018-11-20T00:00:00Z","timestamp":1542672000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s00521-018-3880-8","type":"journal-article","created":{"date-parts":[[2018,11,20]],"date-time":"2018-11-20T08:11:40Z","timestamp":1542701500000},"page":"7623-7639","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Feature selection generating directed rough-spanning tree for crime pattern analysis"],"prefix":"10.1007","volume":"32","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-4729-7652","authenticated-orcid":false,"given":"Priyanka","family":"Das","sequence":"first","affiliation":[]},{"given":"Asit Kumar","family":"Das","sequence":"additional","affiliation":[]},{"given":"Janmenjoy","family":"Nayak","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,20]]},"reference":[{"issue":"4","key":"3880_CR1","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1002\/wics.101","volume":"2","author":"H Abdi","year":"2010","unstructured":"Abdi H, Williams JL (2010) Principal component analysis. WIREs Comput Stat 2(4):433\u2013459","journal-title":"WIREs Comput Stat"},{"issue":"4","key":"3880_CR2","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1109\/72.298224","volume":"5","author":"R Battiti","year":"1994","unstructured":"Battiti R (1994) Using mutual information for selecting features in supervised neural net learning. IEEE Trans Neural Netw 5(4):537\u2013550","journal-title":"IEEE Trans Neural Netw"},{"issue":"8","key":"3880_CR3","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1016\/S0305-0548(00)00007-1","volume":"28","author":"CF Bazlamac","year":"2001","unstructured":"Bazlamac CF, Hindi KS (2001) Minimum-weight spanning tree algorithms a survey and empirical study. Comput Oper Res 28(8):767\u2013785","journal-title":"Comput Oper Res"},{"issue":"10","key":"3880_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel VD, Jean-Loup Guillaume RL, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech Theory Exp 2008(10):1\u201312","journal-title":"J Stat Mech Theory Exp"},{"issue":"2","key":"3880_CR5","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s00453-008-9164-4","volume":"56","author":"N Broutin","year":"2008","unstructured":"Broutin N, Devroye L, McLeish E (2008) Note on the structure of Kruskal\u2019s algorithm. Algorithmica 56(2):141","journal-title":"Algorithmica"},{"key":"3880_CR6","first-page":"1396","volume":"14","author":"YJ Chu","year":"1965","unstructured":"Chu YJ, Liu TH (1965) On the shortest arborescence of a directed graph. Sci Sin 14:1396\u20131400","journal-title":"Sci Sin"},{"key":"3880_CR7","unstructured":"Csardi G, Nepusz T (2006) The igraph software package for complex network research. InterJournal Complex Syst 1695:1\u20139. \nhttp:\/\/igraph.org"},{"issue":"C","key":"3880_CR8","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1016\/j.asoc.2018.01.040","volume":"65","author":"AK Das","year":"2018","unstructured":"Das AK, Sengupta S, Bhattacharyya S (2018) A group incremental feature selection for classification using rough set theory based genetic algorithm. Appl Soft Comput 65(C):400\u2013411","journal-title":"Appl Soft Comput"},{"key":"3880_CR9","unstructured":"Das P, Das AK (2017) 8th international conference on computing, communication and networking technologies, pp 1\u20136"},{"key":"3880_CR10","volume-title":"Graph theory with applications to engineering and computer science","author":"N Deo","year":"1974","unstructured":"Deo N (1974) Graph theory with applications to engineering and computer science. Prentice-Hall Inc, Upper Saddle River"},{"key":"3880_CR11","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-3-540-88425-5_28","volume-title":"Rough sets and current trends in computing","author":"F Fazayeli","year":"2008","unstructured":"Fazayeli F, Wang L, Mandziuk J (2008) Feature selection based on the rough set theory and expectation-maximization clustering algorithm. In: Chan C-C, Grzymala-Busse JW, Ziarko WP (eds) Rough sets and current trends in computing. Springer, Berlin, pp 272\u2013282"},{"issue":"1","key":"3880_CR12","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/1656274.1656278","volume":"11","author":"M Hall","year":"2009","unstructured":"Hall M, Frank E, Holmes G, Pfahringer B, Reutemann P, Witten IH (2009) The WEKA data mining software: an update. SIGKDD Explor 11(1):10\u201318","journal-title":"SIGKDD Explor"},{"key":"3880_CR13","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/3-540-39205-X_15","volume-title":"Rough sets, fuzzy sets, data mining, and granular computing","author":"XT Hu","year":"2003","unstructured":"Hu XT, Lin TY, Han J (2003) A new rough sets model based on database systems. In: Wang G, Liu Q, Yao Y, Skowron A (eds) Rough sets, fuzzy sets, data mining, and granular computing. Springer, Berlin, pp 114\u2013121"},{"key":"3880_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-017-3317-9","author":"RK Huda","year":"2018","unstructured":"Huda RK, Banka H (2018) Efficient feature selection and classification algorithm based on PSO and rough sets. Neural Comput Appl. \nhttps:\/\/doi.org\/10.1007\/s00521-017-3317-9","journal-title":"Neural Comput Appl"},{"key":"3880_CR15","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1016\/j.procs.2017.10.067","volume":"116","author":"MMA Jalil","year":"2017","unstructured":"Jalil MMA, Ling CP, Noor NMM, Mohd F (2017a) Knowledge representation model for crime analysis. Procedia Comput Sci 116:484\u2013491","journal-title":"Procedia Comput Sci"},{"key":"3880_CR16","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.procs.2017.10.018","volume":"116","author":"MMA Jalil","year":"2017","unstructured":"Jalil MMA, Mohd F, Noor NMM (2017b) A comparative study to evaluate filtering methods for crime data feature selection. Procedia Comput Sci 116:113\u2013120","journal-title":"Procedia Comput Sci"},{"issue":"6","key":"3880_CR17","doi-asserted-by":"publisher","first-page":"2353","DOI":"10.1007\/s00500-015-1645-1","volume":"20","author":"MM Janeela Theresa","year":"2016","unstructured":"Janeela Theresa MM, Joseph Raj V (2016) A maximum spanning tree-based dynamic fuzzy supervised neural network architecture for classification of murder cases. Soft Comput 20(6):2353\u20132365","journal-title":"Soft Comput"},{"key":"3880_CR18","doi-asserted-by":"publisher","first-page":"233","DOI":"10.6028\/jres.071B.032","volume":"71","author":"J Edmonds","year":"1967","unstructured":"Edmonds J (1967) Optimum branchings. J Res Natl Bureau Stand 71:233\u2013240","journal-title":"J Res Natl Bureau Stand"},{"issue":"2","key":"3880_CR19","first-page":"896","volume":"9","author":"T Keerthika","year":"2016","unstructured":"Keerthika T, Premalatha K (2016) Rough set reduct algorithm based feature selection for medical domain. J Chem Pharm Sci 9(2):896\u2013902","journal-title":"J Chem Pharm Sci"},{"issue":"1","key":"3880_CR20","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/s10618-012-0268-8","volume":"27","author":"A Lehrmann","year":"2013","unstructured":"Lehrmann A, Huber M, Polatkan AC, Pritzkau A, Nieselt K (2013) Visualizing dimensionality reduction of systems biology data. Data Min Knowl Discov 27(1):146\u2013165","journal-title":"Data Min Knowl Discov"},{"key":"3880_CR21","doi-asserted-by":"crossref","unstructured":"Loper E, Bird S (2002) NLTK: the natural language toolkit. In: Proceedings of the ACL-02 workshop on effective tools and methodologies for teaching natural language processing and computational linguistics, vol 1, pp 63\u201370","DOI":"10.3115\/1118108.1118117"},{"issue":"12","key":"3880_CR22","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan M (2002) Community structure in social and biological networks. Proc Natl Acad Sci USA 99(12):7821\u20137826","journal-title":"Proc Natl Acad Sci USA"},{"issue":"3","key":"3880_CR23","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1016\/j.ijar.2010.09.006","volume":"52","author":"P Maji","year":"2011","unstructured":"Maji P, Paul S (2011) Rough set based maximum relevance-maximum significance criterion and gene selection from microarray data. Int J Approx Reason 52(3):408\u2013426","journal-title":"Int J Approx Reason"},{"key":"3880_CR24","unstructured":"Mikolov T, Chen K, Corrado G, Dean J (2013a) Efficient estimation of word representations in vector space. CoRR. \narXiv:abs\/1301.3781:1\u201312"},{"key":"3880_CR25","unstructured":"Mikolov T, Sutskever I, Chen K, Corrado G, Dean J (2013b) Distributed representations of words and phrases and their compositionality. CoRR. \narXiv:abs\/1310.4546:1\u20139"},{"issue":"23","key":"3880_CR26","doi-asserted-by":"publisher","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"MEJ Newman","year":"2006","unstructured":"Newman MEJ (2006) Modularity and community structure in networks. Proc Natl Acad Sci USA 103(23):8577\u20138582","journal-title":"Proc Natl Acad Sci USA"},{"issue":"5","key":"3880_CR27","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/BF01001956","volume":"11","author":"Z Pawlak","year":"1982","unstructured":"Pawlak Z (1982) Rough sets. Int J Comput Inf Sci 11(5):341\u2013356","journal-title":"Int J Comput Inf Sci"},{"issue":"7","key":"3880_CR28","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1080\/019697298125470","volume":"29","author":"Z Pawlak","year":"1998","unstructured":"Pawlak Z (1998) Rough set theory and its applications to data analysis. Cybern Syst 29(7):661\u2013688","journal-title":"Cybern Syst"},{"issue":"8","key":"3880_CR29","doi-asserted-by":"publisher","first-page":"1226","DOI":"10.1109\/TPAMI.2005.159","volume":"27","author":"H Peng","year":"2005","unstructured":"Peng H, Long F, Ding C (2005) Feature selection based on mutual information criteria of max-dependency, max-relevance, and min-redundancy. IEEE Trans Pattern Anal Mach Intell 27(8):1226\u20131238","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"1","key":"3880_CR30","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1140\/epjst\/e2010-01179-1","volume":"178","author":"M Rosvall","year":"2009","unstructured":"Rosvall M, Axelsson D, Bergstrom CT (2009) The map equation. Eur Phys J Spec Top 178(1):13\u201323","journal-title":"Eur Phys J Spec Top"},{"issue":"12","key":"3880_CR31","first-page":"43","volume":"2","author":"MK Sabu","year":"2018","unstructured":"Sabu MK (2018) A rough set based feature selection approach for the prediction of learning disabilities. Int J Adv Comput Eng Netw 2(12):43\u201348","journal-title":"Int J Adv Comput Eng Netw"},{"issue":"1","key":"3880_CR32","doi-asserted-by":"publisher","first-page":"107","DOI":"10.5121\/ijsc.2012.3109","volume":"3","author":"S Sengupta","year":"2012","unstructured":"Sengupta S, Das AK (2012) Single reduct generation based on relative indiscernibility of rough set theory. Int J Soft Comput 3(1):107\u2013119","journal-title":"Int J Soft Comput"},{"issue":"3","key":"3880_CR33","first-page":"413","volume":"15","author":"LA Shalabi","year":"2017","unstructured":"Shalabi LA (2017) Perceptions of crime behavior and relationships: rough set based approach. Int J Comput Sci Inf Secur 15(3):413\u2013420","journal-title":"Int J Comput Sci Inf Secur"},{"key":"3880_CR34","doi-asserted-by":"crossref","unstructured":"Singh B, Sankhwar JS, Vyas OP (2014) Optimization of feature selection method for high dimensional data using fisher score and minimum spanning tree. In: 2014 annual IEEE India conference (INDICON), pp 1\u20136","DOI":"10.1109\/INDICON.2014.7030450"},{"issue":"1","key":"3880_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TKDE.2011.181","volume":"25","author":"Q Song","year":"2013","unstructured":"Song Q, Ni J, Wang G (2013) A fast clustering-based feature subset selection algorithm for high-dimensional data. IEEE Trans Knowl Data Eng 25(1):1\u201314","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"3880_CR36","volume-title":"Natural language processing in python","author":"EK Steven Bird","year":"2009","unstructured":"Steven Bird EK, Loper E (2009) Natural language processing in python. O\u2019Reilly Media, Sebastopol"},{"issue":"9","key":"3880_CR37","first-page":"1","volume":"2","author":"TR JeraldBeno","year":"2012","unstructured":"JeraldBeno TR, K M (2012) Dimensionality reduction: rough set based feature reduction. Int J Sci Res Publ 2(9):1\u20136","journal-title":"Int J Sci Res Publ"},{"issue":"2","key":"3880_CR38","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1109\/TIFS.2016.2622226","volume":"12","author":"K Taha","year":"2017","unstructured":"Taha K, Yoo PD (2017) Using the spanning tree of a criminal network for identifying its leaders. IEEE Trans Inf Forensics Secur 12(2):445\u2013453","journal-title":"IEEE Trans Inf Forensics Secur"},{"issue":"1","key":"3880_CR39","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1186\/s40537-017-0103-6","volume":"4","author":"J Weng","year":"2017","unstructured":"Weng J, Young DS (2017) Some dimension reduction strategies for the analysis of survey data. J Big Data 4(1):43","journal-title":"J Big Data"},{"issue":"C","key":"3880_CR40","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.knosys.2014.12.031","volume":"80","author":"RR Yager","year":"2015","unstructured":"Yager RR, Alajlan N (2015) Dempster-shafer belief structures for decision making under uncertainty. Knowl Based Syst 80(C):58\u201366","journal-title":"Knowl Based Syst"},{"key":"3880_CR41","unstructured":"Yang HH, Moody J (1999) Feature selection based on joint mutual information. In: Proceedings of international ICSC symposium on advances in intelligent data analysis, pp 22\u201325"},{"issue":"3","key":"3880_CR42","first-page":"1997","volume":"2","author":"Yaswanth Kumar Alapati","year":"2015","unstructured":"Alapati Yaswanth Kumar, Sindhu SSK (2015) Relevant feature selection from high-dimensional data using MST based clustering. Int J Emerg Trends Sci Technol 2(3):1997\u20132001","journal-title":"Int J Emerg Trends Sci Technol"},{"issue":"3","key":"3880_CR43","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1016\/S0019-9958(65)90241-X","volume":"8","author":"L Zadeh","year":"1965","unstructured":"Zadeh L (1965) Fuzzy sets. Inf Control 8(3):338\u2013353","journal-title":"Inf Control"},{"key":"3880_CR44","unstructured":"Zaher AA, Berretta R, Arefin AS, Moscato P (2015) Proceedings of the 13th Australasian data mining conference (AusDM 2015). In: FSMEC: a feature selection method based on the minimum spanning tree and evolutionary computation, pp 129\u2013139"},{"key":"3880_CR45","doi-asserted-by":"crossref","unstructured":"Zhang M, Yao JT (2004) A rough sets based approach to feature selection. In: IEEE annual meeting of the fuzzy information, vol 1, pp 434\u2013439","DOI":"10.1109\/NAFIPS.2004.1336322"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-018-3880-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-018-3880-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-018-3880-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,13]],"date-time":"2020-06-13T08:03:40Z","timestamp":1592035420000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-018-3880-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,20]]},"references-count":45,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["3880"],"URL":"https:\/\/doi.org\/10.1007\/s00521-018-3880-8","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11,20]]},"assertion":[{"value":"19 July 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 November 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 November 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that this manuscript has no conflict of interest with any other published source and has not been published previously (partly or in full). No data have been fabricated or manipulated to support our conclusions.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}