Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yaqiang An

dblp:270/6492 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 88% Data stream processing · 12%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval › cross-modal retrieval
cross-modal hashing
0.412020
Online Collective Matrix Factorization Hashing for Large-Scale Cross-Media Retrieval · SIGIR 2020
Information retrieval
cross-modal retrieval
0.412020
Online Collective Matrix Factorization Hashing for Large-Scale Cross-Media Retrieval · SIGIR 2020
Information retrieval
large-scale retrieval
0.112020
Online Collective Matrix Factorization Hashing for Large-Scale Cross-Media Retrieval · SIGIR 2020
Data stream processing
streaming data retrieval
0.112020
Online Collective Matrix Factorization Hashing for Large-Scale Cross-Media Retrieval · SIGIR 2020

Methods — techniques the papers use, named apart from their topics

online optimization · 0.4collective matrix factorization · 0.4
YearPublicationVenuePosition
2020 Online Collective Matrix Factorization Hashing for Large-Scale Cross-Media Retrieval
abstract
Cross-modal hashing has been widely investigated recently for its efficiency in large-scale cross-media retrieval. However, most existing cross-modal hashing methods learn hash functions in a batch-based learning mode. Such mode is not suitable for large-scale data sets due to the large memory consumption and loses its efficiency when training streaming data. Online cross-modal hashing can deal with the above problems by learning hash model in an online learning process. However, existing online cross-modal hashing methods cannot update hash codes of old data by the newly learned model. In this paper, we propose Online Collective Matrix Factorization Hashing (OCMFH) based on collective matrix factorization hashing (CMFH), which can adaptively update hash codes of old data according to dynamic changes of hash model without accessing to old data. Specifically, it learns discriminative hash codes for streaming data by collective matrix factorization in an online optimization scheme. Unlike conventional CMFH which needs to load the entire data points into memory, the proposed OCMFH retrains hash functions only by newly arriving data points. Meanwhile, it generates hash codes of new data and updates hash codes of old data by the latest updated hash model. In such way, hash codes of new data and old data are well-matched. Furthermore, a zero mean strategy is developed to solve the mean-varying problem in the online hash learning process. Extensive experiments on three benchmark data sets demonstrate the effectiveness and efficiency of OCMFH on online cross-media retrieval.
Di Wang 0011, Quan Wang 0006, Yaqiang An, Xinbo Gao 0001, Yumin Tian
SIGIR3