Exploiting peer relations for distributed multimedia information retrieval

Authors:
Wei Chen;Qing Li;Liu Wenyin
Affiliations:
Department of Computer Science, City University of Hong Kong, Hong Kong SAR, China;Department of Computer Science, City University of Hong Kong, Hong Kong SAR, China;Department of Computer Science, City University of Hong Kong, Hong Kong SAR, China
Venue:
ICME'09 Proceedings of the 2009 IEEE international conference on Multimedia and Expo
Year:
2009

Citing 7
Cited 2

Distributed content-based visual information retrieval system on peer-to-peer networks

ACM Transactions on Information Systems (TOIS)
A survey of trust and reputation systems for online service provision

Decision Support Systems
Using query logs to establish vocabularies in distributed information retrieval

Information Processing and Management: an International Journal
Evaluating sampling methods for uncooperative collections

SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
Adaptive community-based multimedia data retrieval in a distributed environment

Proceedings of the 2nd international conference on Ubiquitous information management and communication
Sample sizes for query probing in uncooperative distributed information retrieval

APWeb'06 Proceedings of the 8th Asia-Pacific Web conference on Frontiers of WWW Research and Development
Scalable Retrieval and Mining With Optimal Peer-to-Peer Configuration

IEEE Transactions on Multimedia

Community-based recipe recommendation and adaptation in peer-to-peer networks

Proceedings of the 4th International Conference on Uniquitous Information Management and Communication
A hybrid recommendation algorithm adapted in e-learning environments

World Wide Web

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a multimedia information retrieval framework in distributed networks, which is suitable for both cooperative and non-cooperative environments and resistant to biased content summaries. The relations of peers are established and evolved according to their historical interactions, which are computed with a peer reputation model. Peers sharing the same topic tend to group themselves together. The resulting structure of the network is exploited to facilitate distributed information retrieval. The characteristic of the network structure is used to infer the content of non-cooperative peers, as well as refining possibly biased content summaries provided by peers. A query forwarding algorithm is introduced for the routing of queries. Simulation experiments show good performance of the proposed method.