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

Kailong Chen

dblp:34/11206 · DBLP profile ↗
← Back
8ranked-venue papers
2as first author
1since 2021 · last 2024
—ORCID · none

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

Databases, data management, data science and information retrieval · 6 · 2 first-authorArtificial intelligence and machine learning · 2Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

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
4 papers
Recommender systems · 31% Web and social media mining · 27% Information retrieval · 24%
Software engineering, system software, and programming languages
1 paper
Services computing and microservices · 100%

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

TopicWeightPapersLastEvidence papers
Information retrieval
text analysis
0.212014
Probabilistic text modeling with orthogonalized topics · SIGIR 2014
Data mining › text mining
topic modeling
0.212014
Probabilistic text modeling with orthogonalized topics · SIGIR 2014
Recommender systems
collaborative filtering
0.112012
SVDFeature: a toolkit for feature-based collaborative filtering · J. Mach. Learn. Res. 2012
Recommender systems › personalized ranking
collaborative ranking
0.112012
Collaborative personalized tweet recommendation · SIGIR 2012
Information retrieval › text analysis
name disambiguation
0.112012
Finding web appearances of social network users via latent factor model · SIGIR 2012
Recommender systems › social recommendation
tweet recommendation
0.112012
Collaborative personalized tweet recommendation · SIGIR 2012
Web and social media mining
user identity linkage
0.112012
Finding web appearances of social network users via latent factor model · SIGIR 2012
Web and social media mining
web mining
0.112012
Finding web appearances of social network users via latent factor model · SIGIR 2012
Web and social media mining
social network analysis
0.122012
Finding web appearances of social network users via latent factor model · SIGIR 2012
Collaborative personalized tweet recommendation · SIGIR 2012
Data mining › text mining
text classification
0.112014
Probabilistic text modeling with orthogonalized topics · SIGIR 2014

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

matrix factorization · 0.3feature engineering · 0.3newton-raphson · 0.2expectation-maximization · 0.2latent factor model · 0.1collaborative ranking · 0.1
YearPublicationVenuePosition
2024 Vision-Sensor Attention Based Continual Multimodal Egocentric Activity Recognition
abstract
Continual learning aims to equip deep neural networks (DNNs) with the capability to continuously learn new knowledge without catastrophic forgetting. Currently, there is significant attention on multimodal continual activity recognition from a egocentric perspective. However, the issue of modality imbalance can lead to exacerbated forgetting in multimodal continual learning. To address this, we propose an exemplar-free vision-sensor Attention-based Incremental Discriminability enhancement (AID) method. Firstly, we employ a Vision-Sensor attention module to enhance the time-frequency information of sensor modality and fuse them with vision modality. This alleviates the modality imbalance problem, yielding more discriminative and generalizable representations. Simultaneously, to prevent the classifier from overfitting to old class prototypes, we enhance old prototypes with features from new classes, thereby enhancing classifier discriminability. We validate the effectiveness of this method through numerous experiments with various task settings on the UESTC-MMEA-CL dataset.
Shaoxu Cheng, Chiyuan He, Kailong Chen, Linfeng Xu 0001, Hongliang Li 0001, Fanman Meng, Qingbo Wu 0001
ICASSP3
2014 Probabilistic text modeling with orthogonalized topics
abstract
Topic models have been widely used for text analysis. Previous topic models have enjoyed great success in mining the latent topic structure of text documents. With many efforts made on endowing the resulting document-topic distributions with different motivations, however, none of these models have paid any attention on the resulting topic-word distributions.Since topic-word distribution also plays an important role in the modeling performance,topic models which emphasize only the resulting document-topic representations but pay less attention to the topic-term distributions are limited. In this paper, we propose the Orthogonalized Topic Model(OTM) which imposes an orthogonality constraint on the topic-term distributions. We also propose a novel model fitting algorithm based on the generalized Expectation-Maximization algorithm and the Newthon-Raphson method. Quantitative evaluation of text classification demonstrates that OTM outperforms other baseline models and indicates the important role played by topic orthogonalizing.
Enpeng Yao, Guoqing Zheng, Ou Jin, Shenghua Bao, Kailong Chen, Zhong Su, Yong Yu 0001
SIGIR5
2013 Diffusion-aware personalized social update recommendation
abstract
Many Internet users have encountered serious information overload problem on social networks such as Facebook and Twitter, where users can consume the streams of social updates from their social connections. Traditional methods solving this problem include collaborative filtering and information diffusion modeling. Both methods answer the "who will adopt what" question from different perspective, while either of them only captures single-faceted knowledge of evidences. In this paper, we solve the personalized social update recommendation problem by proposing a framework which integrates the advantages of collaborative filtering and the characteristics of diffusion processes. The main contributions of this paper are three folds. First, we propose a plenty of diffusion features which capture the characteristics of diffusion processes. Second, we build a joint model which takes the advantages of both collaborative filtering and the characteristics of diffusion processes for recommendation. Finally, experiments on two real-world datasets show that our joint model outperforms the methods capturing single-faceted knowledge and several other baselines.
Feng Cong, Kailong Chen, Yong Yu 0001
RecSys3
2013 Set-oriented personalized ranking for diversified top-n recommendation
abstract
In this paper, we propose a set-oriented personalized ranking model for diversified top-N recommendation. Users may have various individual ranges of interests. For personalized top-N recommendation task, the combination of relevance and diversity in recommendation results would be desirable. For this purpose, we integrate the concept of diversity into traditional matrix factorization model to construct a set-oriented collaborative filtering model. By optimizing this model with a set-oriented pairwise ranking method, we directly achieve personalized top-N recommendation results which are both relevant and diversified. We also utilize category information explicitly for learning personalized diversity. Experimental results show that our model outperforms traditional models in terms of personalized diversity and maintains good performance on relevance prediction.
Ruilong Su, Li'ang Yin, Kailong Chen, Yong Yu 0001
RecSys3
2013 An Empirical Study of User Behaviors on Pinterest Social Network
abstract
Many previous research works have focused on analyzing online social networks in many dimensions, as they bring large commercial value and provide significant references for many other subjects. Pinterest, a pinboard-style image sharing social service, has attracted much attention recently and become one of the most popular social networks. The special mechanism and style of Pinterest distinguish it from other previous popular social networks and shape totally different user behaviors, which makes it worth launching a new study on Pinterest. In this paper, we have an empirical study of user behaviors on Pinterest, based on a large Pinterest dataset containing 1.13 million users, 57 million following relations, 19 million boards and 933 million pins. We focus on studying the characteristics, manifestations and overall effects of user behaviors from many aspects, including the user interests, correlations between neighboring users, the common features of the most popular users, the topology of the network structure, etc. The most distinguishing characteristic of Pinterest is that users focus on everyday lives and are willing to collect many images about decoration, food, fashion, etc, which makes Pinterest an ideal advertising and marketing platform for retail companies. Many other qualitative and quantitative analysis on user behaviors have been discussed in our paper. We provide a comprehensive understanding of user behaviors on the Pinterest social network, which is our main contribution.
Ziming Feng, Feng Cong, Kailong Chen, Yong Yu 0001
Web Intelligence3
2012 Collaborative personalized tweet recommendation
abstract
Twitter has rapidly grown to a popular social network in recent years and provides a large number of real-time messages for users. Tweets are presented in chronological order and users scan the followees' timelines to find what they are interested in. However, an information overload problem has troubled many users, especially those with many followees and thousands of tweets arriving every day. In this paper, we focus on recommending useful tweets that users are really interested in personally to reduce the users' effort to find useful information. Many kinds of information on Twitter are available for helping recommendation, including the user's own tweet history, retweet history and social relations between users. We propose a method of making tweet recommendations based on collaborative ranking to capture personal interests. It can also conveniently integrate the other useful contextual information. Our final method considers three major elements on Twitter: tweet topic level factors, user social relation factors and explicit features such as authority of the publisher and quality of the tweet. The experiments show that all the proposed elements are important and our method greatly outperforms several baseline methods.
Kailong Chen, Tianqi Chen 0001, Guoqing Zheng, Ou Jin, Enpeng Yao, Yong Yu 0001
SIGIR1
2012 Finding web appearances of social network users via latent factor model
abstract
With the rapid growing of Web 2.0, people spend more time on social networks such as Facebook and Twitter. In order to know the people they are interacting with, finding the web appearances of them will help the social network users to a great extent. We propose a novel and effective latent factor model to find web appearances of target social network users. Our method solves the name ambiguity problem by simultaneously exploring the link structure of social networks and the web. Experiments on real-world data show the superiority of our method over several baselines.
Kailong Chen, Zhengdong Lu, Xiaoshi Yin, Yong Yu 0001, Zaiqing Nie
SIGIR1
2012 SVDFeature: a toolkit for feature-based collaborative filtering
Tianqi Chen 0001, Weinan Zhang 0001, Qiuxia Lu, Kailong Chen, Zhao Zheng, Yong Yu 0001
J. Mach. Learn. Res.4