2013 ComparingApplestoOrangesAScalab

• (Ou et al., 2013) ⇒ Mingdong Ou, Peng Cui, Fei Wang, Jun Wang, Wenwu Zhu, and Shiqiang Yang. (2013). “Comparing Apples to Oranges: A Scalable Solution with Heterogeneous Hashing.” In: Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ISBN:978-1-4503-2174-7 doi:10.1145/2487575.2487668

Subject Headings:

Cited By

• http://scholar.google.com/scholar?q=%222013%22+Comparing+Apples+to+Oranges%3A+A+Scalable+Solution+with+Heterogeneous+Hashing
• http://dl.acm.org/citation.cfm?id=2487575.2487668&preflayout=flat#citedby

Quotes

Author Keywords

• Big data; heterogeneous hashing; heterogeneous network; heterogeneous similarity search; information search and retrieval; scalability

Abstract

Although hashing techniques have been popular for the large scale similarity search problem, most of the existing methods for designing optimal hash functions focus on homogeneous similarity assessment, i.e., the data entities to be indexed are of the same type. Realizing that heterogeneous entities and relationships are also ubiquitous in the real world applications, there is an emerging need to retrieve and search similar or relevant data entities from multiple heterogeneous domains, e.g., recommending relevant posts and images to a certain Facebook user. In this paper, we address the problem of comparing apples to orange under the large scale setting. Specifically, we propose a novel Relation-aware Heterogeneous Hashing (RaHH), which provides a general framework for generating hash codes of data entities sitting in multiple heterogeneous domains. Unlike some existing hashing methods that map heterogeneous data in a common Hamming space, the RaHH approach constructs a Hamming space for each type of data entities, and learns optimal mappings between them simultaneously. This makes the learned hash codes flexibly cope with the characteristics of different data domains. Moreover, the RaHH framework encodes both homogeneous and heterogeneous relationships between the data entities to design hash functions with improved accuracy. To validate the proposed RaHH method, we conduct extensive evaluations on two large datasets; one is crawled from a popular social media sites, Tencent Weibo, and the other is an open dataset of Flickr (NUS-WIDE). The experimental results clearly demonstrate that the RaHH outperforms several state-of-the-art hashing methods with significant performance gains.

References

;

	Author	volume	Date Value	title	type	journal	titleUrl	doi	note	year
2013 ComparingApplestoOrangesAScalab	Fei Wang Mingdong Ou Peng Cui Jun Wang Wenwu Zhu Shiqiang Yang			Comparing Apples to Oranges: A Scalable Solution with Heterogeneous Hashing				10.1145/2487575.2487668		2013