{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:35:02Z","timestamp":1742956502445,"version":"3.40.3"},"publisher-location":"New Delhi","reference-count":26,"publisher":"Springer India","isbn-type":[{"type":"print","value":"9788132216018"},{"type":"electronic","value":"9788132216025"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-81-322-1602-5_67","type":"book-chapter","created":{"date-parts":[[2014,2,25]],"date-time":"2014-02-25T12:58:40Z","timestamp":1393333120000},"page":"631-638","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hesitant k-Nearest Neighbor (HK-nn) Classifier for Document Classification and Numerical Result Analysis"],"prefix":"10.1007","author":[{"given":"Neeraj","family":"Sahu","sequence":"first","affiliation":[]},{"given":"R. S.","family":"Thakur","sequence":"additional","affiliation":[]},{"given":"G. S.","family":"Thakur","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,2,26]]},"reference":[{"key":"67_CR1","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1109\/TIT.1975.1055464","volume":"21","author":"GL Ritter","year":"1975","unstructured":"Ritter, G.L., Woodruff, H.B., Lowry, S.R., Isenhour, T.L.: An algorithm for a selective nearest neighbor decision rule. IEEE Trans. Inf. Theory 21, 665\u2013669 (1975)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"67_CR2","doi-asserted-by":"publisher","first-page":"2278","DOI":"10.1109\/5.726791","volume":"81","author":"Y LeCun","year":"1998","unstructured":"LeCun, Y., Bottou, L., Bengio, Y., Haffner, P.: Gradient-based learning applied to document recognition. Proc. IEEE 81(11), 2278\u20132324 (1998)","journal-title":"Proc. IEEE"},{"key":"67_CR3","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1109\/TIT.1968.1054155","volume":"14","author":"PE Hart","year":"1968","unstructured":"Hart, P.E.: Condensed nearest neighbor rule. IEEE Trans. Inf. Theory 14, 515\u2013516 (1968)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"67_CR4","doi-asserted-by":"crossref","first-page":"957","DOI":"10.1109\/34.232083","volume":"15","author":"A. Farago","year":"1993","unstructured":"Farago, A., Linder, T., Lugosi, G.: Fast nearest-neighbor search in dissimilarity spaces. IEEE Trans. Pattern Anal. Mach. Intell. 15(9), 957\u2013962 (1993)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"7","key":"67_CR5","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1109\/T-C.1975.224297","volume":"24","author":"K Fukunaga","year":"1975","unstructured":"Fukunaga, K., Narendra, P.M.: A branch and bound algorithm for computing k-nearest neighbors. IEEE Trans. Comput. 24(7), 750\u2013753 (1975)","journal-title":"IEEE Trans. Comput."},{"issue":"11","key":"67_CR6","doi-asserted-by":"publisher","first-page":"1179","DOI":"10.1109\/T-C.1974.223827","volume":"23","author":"CL Chang","year":"1974","unstructured":"Chang, C.L.: Finding prototypes for nearest neighbor decision rule. IEEE Trans. Comput. 23(11), 1179\u20131184 (1974)","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"67_CR7","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0167-8655(86)90013-9","volume":"4","author":"E Vidal","year":"1986","unstructured":"Vidal, E.: An algorithm for finding nearest neighbors in (approximately) constant average time. Pattern Recogn. Lett. 4(3), 145\u2013157 (1986)","journal-title":"Pattern Recogn. Lett."},{"issue":"1\/2","key":"67_CR8","first-page":"171","volume":"23","author":"A.J. Broder","year":"1986","unstructured":"Broder, A.J.: Strategies for efficient incremental nearest neighbor search. Pattern Recogn. 23(1\/2), 171\u2013178 (1986)","journal-title":"Pattern Recogn."},{"issue":"3","key":"67_CR9","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1109\/21.364867","volume":"25","author":"R.L. Brown","year":"1995","unstructured":"Brown, R.L.: Accelerated template matching using template trees grown by condensation. IEEE Trans. Syst Man Cybern. 25(3), 523\u2013528 (Mar. 1995)","journal-title":"IEEE Trans. Syst Man Cybern."},{"issue":"10","key":"67_CR10","doi-asserted-by":"publisher","first-page":"1000","DOI":"10.1109\/T-C.1975.224110","volume":"24","author":"JH Friedman","year":"1975","unstructured":"Friedman, J.H., Baskett, F., Shustek, L.J.: An algorithm for finding nearest neighbors. IEEE Trans. Comput. 24(10), 1000\u20131006 (1975)","journal-title":"IEEE Trans. Comput."},{"issue":"9","key":"67_CR11","doi-asserted-by":"crossref","first-page":"989","DOI":"10.1109\/34.615448","volume":"19","author":"S.A. Nene","year":"1997","unstructured":"Nene, S.A., Nayar, S.K.: A simple algorithm for nearest-neighbor search in high dimension. IEEE Trans. Pattern Anal. Mach. Intell. 19(9), 989\u20131003 (1997)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"6","key":"67_CR12","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1109\/TPAMI.1986.4767859","volume":"8","author":"BS Kim","year":"1986","unstructured":"Kim, B.S., Park, S.B.: A fast k nearest neighbor finding algorithm based on the ordered partition. IEEE Trans. Pattern Anal. Mach. Intell. 8(6), 761\u2013766 (1986)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"9","key":"67_CR13","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"J.L. Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509\u2013517 (1975)","journal-title":"Commun. ACM"},{"issue":"6","key":"67_CR14","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1109\/34.506411","volume":"18","author":"T Hastie","year":"1996","unstructured":"Hastie, T., Tibshirani, R.: Discriminant adaptive nearest-neighbor classification. IEEE Trans. Pattern Anal. Mach. Intell. 18(6), 607\u2013615 (1996)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"67_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/34.566806","volume":"19","author":"D Hunttenlocher","year":"1997","unstructured":"Hunttenlocher, D., Klanderman, G., Rucklidge, W.: Comparing images using Hausdorff distance. IEEE Trans. Pattern Anal. Mach. Intell. 19(1), 1\u201314 (1997)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"67_CR16","doi-asserted-by":"crossref","unstructured":"Puzicha, J., Buhmann, J., Rubner, Y., Tomasi, C.: Empirical evaluation of dissimilarity measures for color and textures. In: Proceedings of International Conference on Computer Vision, pp. 1165\u20131172 (1999)","DOI":"10.1109\/ICCV.1999.790412"},{"key":"67_CR17","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1002\/(SICI)1098-1098(199624)7:4<304::AID-IMA5>3.0.CO;2-C","volume":"7","author":"JT Favata","year":"1996","unstructured":"Favata, J.T., Srikantan, G.: A multiple feature\/resolution approach to hand printed character\/digit recognition. Proc. Intl J. Imaging Syst. Technol. 7, 304\u2013311 (1996)","journal-title":"Proc. Intl J. Imaging Syst. Technol."},{"issue":"12","key":"67_CR18","doi-asserted-by":"publisher","first-page":"1386","DOI":"10.1109\/34.643899","volume":"19","author":"AK Jain","year":"1997","unstructured":"Jain, A.K., Zongker, D.: Representation and reconstruction of handwritten digits using deformable templates. IEEE Trans. Pattern Anal. Mach. Intell. 19(12), 1386\u20131391 (1997)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"67_CR19","doi-asserted-by":"crossref","unstructured":"Donahue, M., Geiger, D., Hummel, R., Liu, T.: Sparse representations for image decompositions with occlusions. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 7\u201312 (1996)","DOI":"10.1109\/CVPR.1996.517046"},{"issue":"4","key":"67_CR20","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/0031-3203(89)90045-9","volume":"22","author":"JD Tubbs","year":"1989","unstructured":"Tubbs, J.D.: A note on binary template matching. Pattern Recogn. 22(4), 359\u2013365 (1989)","journal-title":"Pattern Recogn."},{"issue":"6","key":"67_CR21","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1109\/34.862197","volume":"22","author":"D.W. Jacobs","year":"2000","unstructured":"Jacobs, D.W., Weinshall, D.: Classification with non-metric distances: image retrieval and class representation. IEEE Trans. Pattern Anal. Mach. Intell. 22(6), 583\u2013600 (June 2000)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"67_CR22","unstructured":"Zhang, B., Srihari, S.N.: Properties of binary vector dissimilarity measures. In: Proceedings of JCIS International Conference on Computer Vision, Pattern Recognition, and Image Processing (2003)"},{"key":"67_CR23","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","volume":"13","author":"TM Cover","year":"1968","unstructured":"Cover, T.M., Hart, P.E.: Nearest neighbor pattern classification. IEEE Trans. Inf. Theory 13, 21\u201327 (1968)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"67_CR24","unstructured":"Neeraj, S., Thakur, G.S.: Hesitant distance similarity measures for document clustering. In: IEEE Conference World Congress on Information and Communication Technologies Mumbai, India. ISBN: 978-1-4673-0125-1, 11\u201314 December 2011"},{"key":"67_CR25","unstructured":"Sahu, S.K., Sahu, N, Thakur, G.S.: Classification of document clustering approaches. Int. J. Adv. Res. Comput. Sci. Softw. Eng. (IJARCSSE) ISSN (ONLINE): 2277 128X, 2(5), 509\u2013513 (2012)"},{"key":"67_CR26","unstructured":"Sahu, B., Sahu, N., Thakur , G.S.: Architecture based users and administrator login data processing In: International Conference on Intelligent Computing and Information System (ICICIS-2012), Pachmarhi, Piparia (MP). ISSN (ONLINE): 2249\u2013071X, Oct. 27\u201328 2012"}],"container-title":["Advances in Intelligent Systems and Computing","Proceedings of the Second International Conference on Soft Computing for Problem Solving (SocProS 2012), December 28-30, 2012"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-81-322-1602-5_67","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T07:26:14Z","timestamp":1675236374000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-81-322-1602-5_67"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9788132216018","9788132216025"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-81-322-1602-5_67","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"26 February 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}