{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T17:15:57Z","timestamp":1725902157303},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319624099"},{"type":"electronic","value":"9783319624105"}],"license":[{"start":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T00:00:00Z","timestamp":1498003200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-62410-5_40","type":"book-chapter","created":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T00:23:02Z","timestamp":1497918182000},"page":"326-333","source":"Crossref","is-referenced-by-count":1,"title":["Recognition of Table Images Using K Nearest Neighbors and Convolutional Neural Networks"],"prefix":"10.1007","author":[{"given":"Ujjwal","family":"Puri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amogh","family":"Tewari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shradha","family":"Katyal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bindu","family":"Garg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,6,21]]},"reference":[{"key":"40_CR1","doi-asserted-by":"crossref","unstructured":"1. Beyer, K., Goldstein, J., Ramakrishnan, R., Shaft, U.: When is nearest neighbor meaningful? In: International conference on database theory. pp. 217\u2013235. Springer (1999)","DOI":"10.1007\/3-540-49257-7_15"},{"key":"40_CR2","doi-asserted-by":"crossref","unstructured":"2. Cover, T., Hart, P.: Nearest neighbor pattern classification. IEEE transactions on information theory 13(1), 21\u201327 (1967)","DOI":"10.1109\/TIT.1967.1053964"},{"key":"40_CR3","doi-asserted-by":"crossref","unstructured":"3. Cover, T., Hart, P.: Nearest neighbor pattern classification. IEEE transactions on information theory 13(1), 21\u201327 (1967)","DOI":"10.1109\/TIT.1967.1053964"},{"key":"40_CR4","doi-asserted-by":"crossref","unstructured":"4. Dudani, S.A.: The distance-weighted k-nearest-neighbor rule. IEEE Transactions on Systems, Man, and Cybernetics (4), 325\u2013327 (1976)","DOI":"10.1109\/TSMC.1976.5408784"},{"key":"40_CR5","doi-asserted-by":"crossref","unstructured":"5. Garcia, V., Debreuve, E., Barlaud, M.: Fast k nearest neighbor search using gpu. In: Computer Vision and Pattern Recognition Workshops, 2008. CVPRW\u201908. IEEE Computer Society Conference on. pp. 1\u20136. IEEE (2008)","DOI":"10.1109\/CVPRW.2008.4563100"},{"key":"40_CR6","doi-asserted-by":"crossref","unstructured":"6. Ghosh, A.K.: On optimum choice of k in nearest neighbor classification. Computational Statistics & Data Analysis 50(11), 3113\u20133123 (2006)","DOI":"10.1016\/j.csda.2005.06.007"},{"key":"40_CR7","unstructured":"7. Le Cun, B.B., Denker, J.S., Henderson, D., Howard, R.E., Hubbard, W., Jackel, L.D.: Handwritten digit recognition with a back-propagation network. In: Advances in neural information processing systems. Citeseer (1990)"},{"key":"40_CR8","doi-asserted-by":"crossref","unstructured":"8. LeCun, Y., Boser, B., Denker, J.S., Henderson, D., Howard, R.E., Hubbard,W., Jackel, L.D.: Backpropagation applied to handwritten zip code recognition. Neural computation 1(4), 541\u2013551 (1989)","DOI":"10.1162\/neco.1989.1.4.541"},{"key":"40_CR9","doi-asserted-by":"crossref","unstructured":"9. LeCun, Y., Bottou, L., Bengio, Y., Haffner, P.: Gradient-based learning applied to document recognition. Proceedings of the IEEE 86(11), 2278\u20132324 (1998)","DOI":"10.1109\/5.726791"},{"key":"40_CR10","doi-asserted-by":"crossref","unstructured":"10. LeCun, Y., Kavukcuoglu, K., Farabet, C., et al.: Convolutional networks and applications in vision. In: ISCAS. pp. 253\u2013256 (2010)","DOI":"10.1109\/ISCAS.2010.5537907"},{"key":"40_CR11","doi-asserted-by":"crossref","unstructured":"11. Lee, Y.: Handwritten digit recognition using k nearest-neighbor, radial-basis function, and backpropagation neural networks. Neural computation 3(3), 440\u2013449 (1991)","DOI":"10.1162\/neco.1991.3.3.440"},{"key":"40_CR12","unstructured":"12. Simonyan, K., Zisserman, A.: Very deep convolutional networks for large-scale image recognition. arXiv preprint \narXiv:1409.1556\n\n (2014)"},{"key":"40_CR13","doi-asserted-by":"crossref","unstructured":"13. Smith, S.J., Bourgoin, M.O., Sims, K., Voorhees, H.L.: Handwritten character classification using nearest neighbor in large databases. IEEE Transactions on Pattern Analysis and Machine Intelligence 16(9), 915\u2013919 (1994)","DOI":"10.1109\/34.310689"},{"key":"40_CR14","doi-asserted-by":"crossref","unstructured":"14. Song, Z., Roussopoulos, N.: K-nearest neighbor search for moving query point. In: International Symposium on Spatial and Temporal Databases. pp. 79\u201396. Springer (2001)","DOI":"10.1007\/3-540-47724-1_5"},{"key":"40_CR15","unstructured":"15. Srivastava, N., Hinton, G.E., Krizhevsky, A., Sutskever, I., Salakhutdinov, R.: Dropout: a simple way to prevent neural networks from overfitting. Journal of Machine Learning Research 15(1), 1929\u20131958 (2014)"}],"container-title":["Advances in Intelligent Systems and Computing","Distributed Computing and Artificial Intelligence, 14th International Conference"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-62410-5_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T00:38:05Z","timestamp":1497919085000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-62410-5_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,21]]},"ISBN":["9783319624099","9783319624105"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62410-5_40","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2017,6,21]]}}}