{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:49:08Z","timestamp":1750308548016,"version":"3.41.0"},"reference-count":0,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2015,6,23]],"date-time":"2015-06-23T00:00:00Z","timestamp":1435017600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGIR Forum"],"published-print":{"date-parts":[[2015,6,23]]},"abstract":"<jats:p>Text-Based Ephemeral Clustering for Web Image Retrieval on Mobile Devices.<\/jats:p>\n          <jats:p>Our specific contributions in this dissertation are: two algorithms, two datasets and an evaluation tool. The Dual C-means algorithm is the main product of these. Dual C-means can be seen as a generalization of our previous proposal the AGK-means. Both algorithms are based on word-word similarity metrics and on the classical K-means algorithm. A new dataset for a complete evaluation of search results clustering (SRC) algorithms is developed and presented. Similarly, a new Web image dataset is developed and used together with a new metric to measure the users' effort when a set of Web images is explored. Finally, we developed an evaluation tool for the SRC problem, in which we have implemented several classical and recent SRC metrics.<\/jats:p>\n          <jats:p>In order to validate our hypothesis, we performed a great deal of different experiments with the datasets mentioned above. Three valuable characteristics are evaluated in the proposed algorithms. First, clustering quality, in which classical and recent evaluation metrics are considered. Secondly, the labelling quality of each cluster is evaluated to make sure that all possible query intents are covered. Thirdly and finally, we evaluate the user's effort in exploring the clustered results presented as horizontal image strips. For these three, we use several datasets- some of which are built to evaluate individual or combinations of these characteristics.<\/jats:p>\n          <jats:p>We have made our conclusions on the numerous factors discussed in this dissertation. In essence, the proposed Dual C-means algorithm, is capable of obtaining proper clustering partitions and simultaneously ensuring high quality labels. When images are displayed on a mobile device's interface, our results indicate that the users' effort to explore the Web image results is reduced.<\/jats:p>","DOI":"10.1145\/2795403.2795419","type":"journal-article","created":{"date-parts":[[2015,6,25]],"date-time":"2015-06-25T14:36:19Z","timestamp":1435242979000},"page":"67-67","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Text-Based Ephemeral Clustering for Web Image Retrieval on Mobile Devices"],"prefix":"10.1145","volume":"49","author":[{"given":"Jose G.","family":"Moreno","sequence":"first","affiliation":[{"name":"Univesit\u00e9 de Caen Basse-Normandie"}]}],"member":"320","published-online":{"date-parts":[[2015,6,23]]},"container-title":["ACM SIGIR Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2795403.2795419","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2795403.2795419","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:03:40Z","timestamp":1750273420000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2795403.2795419"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,23]]},"references-count":0,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,6,23]]}},"alternative-id":["10.1145\/2795403.2795419"],"URL":"https:\/\/doi.org\/10.1145\/2795403.2795419","relation":{},"ISSN":["0163-5840"],"issn-type":[{"type":"print","value":"0163-5840"}],"subject":[],"published":{"date-parts":[[2015,6,23]]},"assertion":[{"value":"2015-06-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}