{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T08:40:10Z","timestamp":1746348010745,"version":"3.40.4"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319100845"},{"type":"electronic","value":"9783319100852"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-10085-2_22","type":"book-chapter","created":{"date-parts":[[2014,8,20]],"date-time":"2014-08-20T03:14:54Z","timestamp":1408504494000},"page":"240-247","source":"Crossref","is-referenced-by-count":2,"title":["Reducing Redundant Information in Search Results Employing Approximation Algorithms"],"prefix":"10.1007","author":[{"given":"Christos","family":"Makris","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yannis","family":"Plegas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yannis C.","family":"Stamatiou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elias C.","family":"Stavropoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Athanasios K.","family":"Tsakalidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"8-13","key":"22_CR1","first-page":"1157","volume":"29","author":"A.Z. Broder","year":"1997","unstructured":"Broder, A.Z., Glassman, S.G., Manasse, M.S., Zweig, G.Z.: Syntactic Clustering on the Web. Computer Networks\u00a029(8-13), 1157\u20131166 (1997)","journal-title":"Computer Networks"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45123-4_1","volume-title":"Combinatorial Pattern Matching","author":"A.Z. Broder","year":"2000","unstructured":"Broder, A.Z.: Identifying and Filtering Near-Duplicate Documents. In: Giancarlo, R., Sankoff, D. (eds.) CPM 2000. LNCS, vol.\u00a01848, pp. 1\u201310. Springer, Heidelberg (2000)"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Charikar, M.: Similarity Estimation Techniques form Rounding Algorithms. In: 34th Annual Symposium on Theory of Computing, pp. 380\u2013388 (2002)","DOI":"10.1145\/509961.509965"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Chen, H., Karger, D.R.: Less is More: Probabilistic Models for retrieving Fewer Relevant Documents. In: 29th Intern. ACM SIGIR Conf., pp. 429\u2013436 (2006)","DOI":"10.1145\/1148170.1148245"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Clarke, C., Kolla, M., Cormack, G., Vechtomova, O., Ashkan, A., B\u00fcttcher, S., MacKinnon, I.: Novelty and diversity in information retrieval evaluation. In: 31st Annual International ACM SIGIR Conf., Singapore, July 20-24 (2008)","DOI":"10.1145\/1390334.1390446"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Clarke, C.L.A., Craswell, N., Soboroff, I.: Overview of the TREC 2009 Web Track. In: 18th TREC Conference (2009)","DOI":"10.6028\/NIST.SP.500-278.web-overview"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Clarke, C.L.A., Craswell, N., Soboroff, I., Cormack, G.: Overview of the TREC 2010 Web Track. In: 19th TREC Conference (2010)","DOI":"10.6028\/NIST.SP.500-294.web-overview"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Clarke, C.L.A., Craswell, N., Soboroff, I.: Overview of the TREC 2011 Web track. In: 20th TREC Conference (2011)","DOI":"10.6028\/NIST.SP.500-296.web-overview"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Clarke, C.L.A., Craswell, N., Voorhees, E.M.: Overview of the TREC 2012 Web track. In: 21th TREC Conference (2012)","DOI":"10.6028\/NIST.SP.500-298.web-overview"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/j.ipl.2010.12.003","volume":"111","author":"R. Clifford","year":"2011","unstructured":"Clifford, R., Popa, A.: Maximum subset intersection. Information Processing Letters\u00a0111, 323\u2013325 (2011)","journal-title":"Information Processing Letters"},{"key":"22_CR11","unstructured":"Deng, F., Rafiei, D.: Estimating the Number of Near Duplicate Document Pairs for Massive Data Sets using Small Space. University of Alberta, Canada (2007)"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Fellbaum, C.: WordNet: An Electronic Lexical Database. MIT Press (1998)","DOI":"10.7551\/mitpress\/7287.001.0001"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Jarvelin, K., Kekalainen, J.: IR Evaluation Methods for Retrieving Highly Relevant Documents. In: 23rd International ACM SIGIR Conference, pp. 41\u201348 (2000)","DOI":"10.1145\/345508.345545"},{"key":"22_CR14","unstructured":"Hajishirzi, H., Wen-Tau, Y., Kolcz, A.: Adaptive Near-Duplicate Detection via Similarity Learning. In: 23rd International ACM SIGIR Conference, pp. 10\u201317 (2000)"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Henzinger, M.R.: Finding Near-Duplicate Web Pages: A Large-Scale Evaluation of Algorithms. In: 29th Intern. ACM SIGIR Conference, pp. 284\u2013291 (2006)","DOI":"10.1145\/1148170.1148222"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Huffman, S., Lehman, A., Stolboushkin, A., Wong-Toi, H., Yang, F., Roehrig, H.: Multiple-Signal Duplicate Detection for Search Evaluation. In: 30th International ACM SIGIR Conference, pp. 223\u2013230 (2007)","DOI":"10.1145\/1277741.1277782"},{"issue":"4","key":"22_CR17","first-page":"514","volume":"32","author":"J.P. Kumar","year":"2009","unstructured":"Kumar, J.P., Govindarajulu, P.: Duplicate and Near Duplicate Documents Detection: A Review. European Journal of Scientific Research\u00a032(4), 514\u2013527 (2009)","journal-title":"European Journal of Scientific Research"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Manning, C.D., Raghavan, P., Schutze, H.: Introduction to Information Retrieval. Cambridge University Press (2008)","DOI":"10.1017\/CBO9780511809071"},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"Navigli, R.: Word Sense Disambiguation. ACM Computing\u00a041(2), 10:1\u201310:69 (2003)","DOI":"10.1145\/1459352.1459355"},{"key":"22_CR20","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/S0166-218X(03)00333-0","volume":"131","author":"R. Peeters","year":"2003","unstructured":"Peeters, R.: The maximum edge biclique problem is NP-complete. Discrete Applied Mathematics\u00a0131, 651\u2013654 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"22_CR21","doi-asserted-by":"crossref","unstructured":"Plegas, Y., Stamou, S.: Reducing information redundancy in search results. In: SAC 2013, pp. 886\u2013893 (2013)","DOI":"10.1145\/2480362.2480533"},{"key":"22_CR22","doi-asserted-by":"crossref","unstructured":"Radlinski, F., Bennett, P.N., Yilmaz, E.: Detecting Duplicate Web Documents using Clickthrough Data. In: 4th Intern. Conf. on WSDM, pp. 147\u2013156 (2011)","DOI":"10.1145\/1935826.1935859"},{"key":"22_CR23","unstructured":"Salton, G., McGill, M.: Introduction to Modern Information Retrieval. McGraw-Hill (1998)"},{"key":"22_CR24","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1016\/j.ipl.2012.06.014","volume":"112","author":"M.-Z. Shieh","year":"2012","unstructured":"Shieh, M.-Z., Tsai, S.-C., Yang, M.-C.: On the inapproximability of maximum intersection problems. Information Processing Letters\u00a0112, 723\u2013727 (2012)","journal-title":"Information Processing Letters"},{"key":"22_CR25","doi-asserted-by":"crossref","unstructured":"Theobald, M., Siddharth, J., Paepcke, A.: Spotsigs: Robust and Efficient Near Duplicate Detection in Large Web Collections. In: 31st ACM SIGIR C., pp. 563\u2013570 (2008)","DOI":"10.1145\/1390334.1390431"},{"key":"22_CR26","unstructured":"Vinterbo, S.A.: A note on the hardness of the \u03ba-ambiguity problem. Technical Report DSG TR 2002\/06 (2002)"},{"key":"22_CR27","unstructured":"Vinterbo, S.A.: Maximum \u03ba-intersection, edge labeled multigraph max capacity \u03ba-path, and max factor \u03ba-gcd are all NP-hard. Technical Report DSG TR (2002)"},{"issue":"8","key":"22_CR28","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1109\/TKDE.2004.31","volume":"16","author":"S.A. Vinterbo","year":"2002","unstructured":"Vinterbo, S.A.: Privacy: A machine learning view. IEEE Transactions on Knowledge and Data Engineering\u00a016(8), 939\u2013948 (2002)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"22_CR29","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1016\/j.ipl.2012.03.007","volume":"112","author":"E.C. Xavier","year":"2012","unstructured":"Xavier, E.C.: A note on a maximum \u03ba-subset intersection problem. Information Processing Letters\u00a0112, 471\u2013472 (2012)","journal-title":"Information Processing Letters"},{"key":"22_CR30","unstructured":"Wu, Z., Palmer, M.: Web Semantics and Lexical Selection. In: ACL Meeting (1998)"},{"key":"22_CR31","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Callan, J., Minka, T.: Novelty and Redundancy Detection in Adaptive Filtering. In: 25th International ACM SIGIR Conference (2002)","DOI":"10.1145\/564392.564393"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-10085-2_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T08:27:24Z","timestamp":1746347244000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-10085-2_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319100845","9783319100852"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10085-2_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}