{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T20:00:12Z","timestamp":1725912012580},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319684734"},{"type":"electronic","value":"9783319684741"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-68474-1_21","type":"book-chapter","created":{"date-parts":[[2017,9,27]],"date-time":"2017-09-27T15:15:48Z","timestamp":1506525348000},"page":"300-314","source":"Crossref","is-referenced-by-count":2,"title":["DeepBrowse: Similarity-Based Browsing Through Large Lists (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Haochen","family":"Chen","sequence":"first","affiliation":[]},{"given":"Arvind Ram","family":"Anantharam","sequence":"additional","affiliation":[]},{"given":"Steven","family":"Skiena","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,9,28]]},"reference":[{"unstructured":"Al-Rfou, R., Perozzi, B., Skiena, S.: Polyglot: distributed word representations for multilingual NLP. In: CoNLL 2013, p. 183 (2013)","key":"21_CR1"},{"doi-asserted-by":"crossref","unstructured":"Andr\u00e9, P., Teevan, J., Dumais, S.T.: From x-rays to silly putty via Uranus: serendipity and its role in web search. In: Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, pp. 2033\u20132036. ACM (2009)","key":"21_CR2","DOI":"10.1145\/1518701.1519009"},{"doi-asserted-by":"crossref","unstructured":"Andr\u00e9, P., Teevan, J., Dumais, S.T., et al.: Discovery is never by chance: designing for (un) serendipity. In: Proceedings of the Seventh ACM Conference on Creativity and Cognition, pp. 305\u2013314. ACM (2009)","key":"21_CR3","DOI":"10.1145\/1640233.1640279"},{"issue":"2","key":"21_CR4","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1137\/S0097539797320281","volume":"29","author":"EM Arkin","year":"2000","unstructured":"Arkin, E.M., Chiang, Y.J., Mitchell, J.S.B., Skiena, S.S., Yang, T.: On the maximum scatter TSP. SIAM J. Comput. 29(2), 515\u2013544 (2000)","journal-title":"SIAM J. Comput."},{"unstructured":"Arthur, D., Vassilvitskii, S.: k-means++: the advantages of careful seeding. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1027\u20131035. Society for Industrial and Applied Mathematics (2007)","key":"21_CR5"},{"doi-asserted-by":"crossref","unstructured":"Belkin, M., Niyogi, P.: Laplacian Eigenmaps and spectral techniques for embedding and clustering. In: NIPS, vol. 14, pp. 585\u2013591 (2001)","key":"21_CR6","DOI":"10.7551\/mitpress\/1120.003.0080"},{"doi-asserted-by":"crossref","unstructured":"Blum, A., Chalasani, P., Coppersmith, D., Pulleyblank, B., Raghavan, P., Sudan, M.: The minimum latency problem. In: Proceedings of the Twenty-sixth Annual ACM Symposium on Theory of Computing, pp. 163\u2013171. ACM (1994)","key":"21_CR7","DOI":"10.1145\/195058.195125"},{"doi-asserted-by":"crossref","unstructured":"Bordino, I., Mejova, Y., Lalmas, M.: Penguins in sweaters, or serendipitous entity search on user-generated content. In: Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, pp. 109\u2013118. ACM (2013)","key":"21_CR8","DOI":"10.1145\/2505515.2505680"},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-319-25087-8_17","volume-title":"Similarity Search and Applications","author":"Y Chen","year":"2015","unstructured":"Chen, Y., Perozzi, B., Skiena, S.: Vector-based similarity measurements for historical figures. In: Amato, G., Connor, R., Falchi, F., Gennaro, C. (eds.) SISAP 2015. LNCS, vol. 9371, pp. 179\u2013190. Springer, Cham (2015). doi: 10.1007\/978-3-319-25087-8_17"},{"doi-asserted-by":"crossref","unstructured":"Clarke, C.L., Kolla, M., Cormack, G.V., Vechtomova, O., Ashkan, A., B\u00fcttcher, S., MacKinnon, I.: Novelty and diversity in information retrieval evaluation. In: Proceedings of the 31st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 659\u2013666. ACM (2008)","key":"21_CR10","DOI":"10.1145\/1390334.1390446"},{"key":"21_CR11","doi-asserted-by":"crossref","DOI":"10.1201\/9781420036121","volume-title":"Multidimensional Scaling","author":"TF Cox","year":"2000","unstructured":"Cox, T.F., Cox, M.A.: Multidimensional Scaling. CRC Press, Boca Raton (2000)"},{"issue":"6","key":"21_CR12","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"GA Croes","year":"1958","unstructured":"Croes, G.A.: A method for solving traveling-salesman problems. Oper. Res. 6(6), 791\u2013812 (1958)","journal-title":"Oper. Res."},{"issue":"1","key":"21_CR13","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/1352782.1352787","volume":"15","author":"O Bruijn De","year":"2008","unstructured":"De Bruijn, O., Spence, R.: A new framework for theory-based interaction design applied to serendipitous information retrieval. ACM Trans. Comput. Hum. Interact. (TOCHI) 15(1), 5 (2008)","journal-title":"ACM Trans. Comput. Hum. Interact. (TOCHI)"},{"unstructured":"Hauff, C., Houben, G.J.: Serendipitous browsing: stumbling through wikipedia. In: Searching4Fun! Workshop (2012)","key":"21_CR14"},{"doi-asserted-by":"crossref","unstructured":"Hoffman, K.L., Padberg, M., Rinaldi, G.: Traveling salesman problem. In: Encyclopedia of Operations Research and Management Science, pp. 1573\u20131578. Springer (2013)","key":"21_CR15","DOI":"10.1007\/978-1-4419-1153-7_1068"},{"issue":"2","key":"21_CR16","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21(2), 498\u2013516 (1973)","journal-title":"Oper. Res."},{"doi-asserted-by":"crossref","unstructured":"Liu, H., Xie, X., Tang, X., Li, Z.W., Ma, W.Y.: Effective browsing of web image search results. In: Proceedings of the 6th ACM SIGMM International Workshop on Multimedia Information Retrieval, pp. 84\u201390. ACM (2004)","key":"21_CR17","DOI":"10.1145\/1026711.1026726"},{"unstructured":"Mikolov, T., Sutskever, I., Chen, K., Corrado, G.S., Dean, J.: Distributed representations of words and phrases and their compositionality. In: Advances in Neural Information Processing Systems, pp. 3111\u20133119 (2013)","key":"21_CR18"},{"issue":"3","key":"21_CR19","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(77)90012-3","volume":"4","author":"CH Papadimitriou","year":"1977","unstructured":"Papadimitriou, C.H.: The Euclidean travelling salesman problem is NP-complete. Theoret. Comput. Sci. 4(3), 237\u2013244 (1977)","journal-title":"Theoret. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Perozzi, B., Al-Rfou, R., Skiena, S.: DeepWalk: online learning of social representations. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 701\u2013710. ACM (2014)","key":"21_CR20","DOI":"10.1145\/2623330.2623732"},{"doi-asserted-by":"crossref","unstructured":"Rodden, K., Basalaj, W., Sinclair, D., Wood, K.: Evaluating a visualisation of image similarity as a tool for image browsing. In: IEEE Symposium on Information Visualization, pp. 36\u201343. IEEE (1999)","key":"21_CR21","DOI":"10.1109\/INFVIS.1999.801855"},{"issue":"3","key":"21_CR22","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1137\/0206041","volume":"6","author":"DJ Rosenkrantz","year":"1977","unstructured":"Rosenkrantz, D.J., Stearns, R.E., Lewis, P.M.: An analysis of several heuristics for the traveling salesman problem. SIAM J. Comput. 6(3), 563\u2013581 (1977)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Skiena, S.S., Ward, C.B.: Who\u2019s Bigger? Where Historical Figures Really Rank. Cambridge University Press, Cambridge (2013)","key":"21_CR23","DOI":"10.1017\/CBO9781139649605"},{"issue":"5500","key":"21_CR24","doi-asserted-by":"crossref","first-page":"2319","DOI":"10.1126\/science.290.5500.2319","volume":"290","author":"JB Tenenbaum","year":"2000","unstructured":"Tenenbaum, J.B., De Silva, V., Langford, J.C.: A global geometric framework for nonlinear dimensionality reduction. Science 290(5500), 2319\u20132323 (2000)","journal-title":"Science"},{"unstructured":"Toms, E.G.: Serendipitous information retrieval. In: DELOS Workshop: Information Seeking, Searching and Querying in Digital Libraries, Zurich (2000)","key":"21_CR25"}],"container-title":["Lecture Notes in Computer Science","Similarity Search and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68474-1_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,27]],"date-time":"2024-06-27T09:15:08Z","timestamp":1719479708000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68474-1_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319684734","9783319684741"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68474-1_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}