{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T00:45:18Z","timestamp":1761007518721,"version":"build-2065373602"},"reference-count":9,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2009,6,1]],"date-time":"2009-06-01T00:00:00Z","timestamp":1243814400000},"content-version":"vor","delay-in-days":517,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc of Assoc for Info"],"published-print":{"date-parts":[[2008,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>As a type of relevance feedback, Scatter\/Gather demonstrates an interactive approach to relevance mapping and reinforcement. The Scatter\/Gather model, proposed by Cutting, Karger, Pedersen, and Tukey (1992), is well known for its effectiveness in situations where it is difficult to precisely specify a query. However, online clustering on a large data corpus is computationally complex and extremely time consuming. This has prohibited the method's real world application for responsive services. In this paper, we proposed and evaluated a new clustering algorithm called LAIR2, which has linear worst\u2010case time complexity and constant running time average for Scatter\/Gather browsing. Our experiment showed when running on a single processor, the LAIR2 online clustering algorithm is several hundred times faster than a classic parallel algorithm running on multiple processors. The efficiency of the LAIR2 algorithm promises real\u2010time Scatter\/Gather browsing services. We have implemented an online visualization prototype, namely, LAIR2 Scatter\/Gather browser, to demonstrate its utility and usability.<\/jats:p>","DOI":"10.1002\/meet.2008.1450450269","type":"journal-article","created":{"date-parts":[[2009,6,3]],"date-time":"2009-06-03T09:48:20Z","timestamp":1244022500000},"page":"1-10","source":"Crossref","is-referenced-by-count":2,"title":["Toward responsive visualization services for scatter\/gather browsing"],"prefix":"10.1002","volume":"45","author":[{"given":"Weimao","family":"Ke","sequence":"first","affiliation":[]},{"given":"Javed","family":"Mostafa","sequence":"additional","affiliation":[]},{"given":"Yong","family":"Liu","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2009,6,3]]},"reference":[{"key":"e_1_2_7_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/130226.134466"},{"key":"e_1_2_7_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/74224.74243"},{"key":"e_1_2_7_4_1","doi-asserted-by":"crossref","unstructured":"Cutting D. R. Karger D. Pedersen J. O. &Tukey J. W.(1992). Scatter\/Gather: A cluster\u2010based approach to browsing large document collections. InThe 15th annual ACMSIGIR(pp.318\u2013329).","DOI":"10.1145\/133160.133214"},{"key":"e_1_2_7_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/160688.160706"},{"key":"e_1_2_7_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/243199.243216"},{"key":"e_1_2_7_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/584792.584919"},{"issue":"3","key":"e_1_2_7_8_1","first-page":"265","article-title":"Jul). Medical subject headings (mesh)","volume":"88","author":"Lipscomb C. E.","year":"2000","journal-title":"Bull Med Libr Assoc"},{"volume-title":"A fast online clustering algorithm for Scatter\/Gather browsing","year":"2007","author":"Liu Y.","key":"e_1_2_7_9_1"},{"key":"e_1_2_7_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1183614.1183667"}],"container-title":["Proceedings of the American Society for Information Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fmeet.2008.1450450269","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fmeet.2008.1450450269","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/asistdl.onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/meet.2008.1450450269","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T13:44:35Z","timestamp":1760967875000},"score":1,"resource":{"primary":{"URL":"https:\/\/asistdl.onlinelibrary.wiley.com\/doi\/10.1002\/meet.2008.1450450269"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,1]]}},"alternative-id":["10.1002\/meet.2008.1450450269"],"URL":"https:\/\/doi.org\/10.1002\/meet.2008.1450450269","archive":["Portico"],"relation":{},"ISSN":["0044-7870","1550-8390"],"issn-type":[{"type":"print","value":"0044-7870"},{"type":"electronic","value":"1550-8390"}],"subject":[],"published":{"date-parts":[[2008,1]]}}}