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

Jianying Lin

dblp:28/8125 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
2since 2021 · last 2022
—ORCID · none

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

Artificial intelligence and machine learning · 3 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 2 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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
2 papers
Recommender systems · 60% Data mining · 33% Machine learning and data management · 7%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Recommender systems › large-scale recommendation
large-scale recommendation model training
0.612022
Persia: An Open, Hybrid System Scaling Deep Learning-based Recommenders up to 100 Trillion Parameters · KDD 2022
Recommender systems
neural recommendation
0.612022
Persia: An Open, Hybrid System Scaling Deep Learning-based Recommenders up to 100 Trillion Parameters · KDD 2022
Distributed systems › distributed machine learning
distributed training
0.612022
Persia: An Open, Hybrid System Scaling Deep Learning-based Recommenders up to 100 Trillion Parameters · KDD 2022
Recommender systems › collaborative filtering
matrix factorization
0.412020
Affinity Regularized Non-Negative Matrix Factorization for Lifelong Topic Modeling · IEEE Trans. Knowl. Data Eng. 2020
Data mining › dimensionality reduction
nonnegative matrix factorization
0.412020
Affinity Regularized Non-Negative Matrix Factorization for Lifelong Topic Modeling · IEEE Trans. Knowl. Data Eng. 2020
Data mining › text mining
topic modeling
0.412020
Affinity Regularized Non-Negative Matrix Factorization for Lifelong Topic Modeling · IEEE Trans. Knowl. Data Eng. 2020
Machine learning and data management
data management for machine learning
0.212022
Persia: An Open, Hybrid System Scaling Deep Learning-based Recommenders up to 100 Trillion Parameters · KDD 2022

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

hybrid training algorithm · 1.1embedding synchronization · 1.1dense neural network synchronization · 1.1sparsity regularization · 0.4graph laplacian regularization · 0.4
YearPublicationVenuePosition
2022 Persia: An Open, Hybrid System Scaling Deep Learning-based Recommenders up to 100 Trillion Parameters
abstract
Recent years have witnessed an exponential growth of model scale in deep learning-based recommender systems---from Google's 2016 model with 1 billion parameters to the latest Facebook's model with 12 trillion parameters. Significant quality boost has come with each jump of the model capacity, which makes us believe the era of 100 trillion parameters is around the corner. However, the training of such models is challenging even within industrial scale data centers. We resolve this challenge by careful co-design of both optimization algorithm and distributed system architecture. Specifically, to ensure both the training efficiency and the training accuracy, we design a novel hybrid training algorithm, where the embedding layer and the dense neural network are handled by different synchronization mechanisms; then we build a system called Persia (short for parallel recommendation training system with hybrid acceleration) to support this hybrid training algorithm. Both theoretical demonstrations and empirical studies with up to 100 trillion parameters have been conducted to justify the system design and implementation of Persia. We make Persia publicly available (at github.com/PersiaML/Persia) so that anyone can easily train a recommender model at the scale of 100 trillion parameters.
Xiangru Lian, Binhang Yuan, Yongjun He 0004, Honghuan Wu, Haodong Lyu, Chengjun Liu, Xing Dong, Yiqiao Liao, Mingnan Luo, Congfei Zhang, Jingru Xie, Haonan Li 0006, Lei Chen 0002, Renjie Huang, Jianying Lin, Chengchun Shu, Xuezhong Qiu, Zhishan Liu, Dongying Kong, Lei Yuan 0001, Sen Yang 0004, Ce Zhang 0001, Ji Liu 0002
KDD18
2021 Penetration Properties of Ground Penetrating Radar Waves Through Rebar Grids
abstract
Ground-penetrating radar (GPR) has been widely applied to the nondestructive inspection of concrete structures such as tunnel lining, bridge deck, and retaining wall, which are usually reinforced by steel bars. The scattering of electromagnetic (EM) waves caused by the dense steel rebar embedded in the concrete structures has a severe influence on the penetration capacity of GPR waves. In this letter, the scattering and penetration characteristics of EM waves propagating through rebar net are investigated via both numerical and laboratory experiments, with an aim to select the antenna nominal frequency for a different reinforcement density. The results show that the rebar, which is perpendicular to the polarization direction of GPR waves and has a very small diameter compared with the wavelength, is almost transparent to the impinged GPR waves. The scattering and interaction of GPR waves caused by the rebar that is parallel to the polarization direction result in a shielding effect, which is manifested as a blind band in the low-frequency range in the transmitted spectrum. This result violates the rule of thumb commonly used in the GPR community, i.e., the lower frequency has a deeper GPR penetration depth. In the end, a low cutoff frequency is recommended for selecting a GPR antenna with an appropriate nominal frequency when it is used in the detection of an anomaly inside and behind a reinforced concrete structure, in which the spacing of the rebar net is known.
Hai Liu 0002, Hantao Lu, Jianying Lin, Feng Han 0005, B. F. Spencer Jr.
IEEE Geosci. Remote. Sens. Lett.3
2020 Affinity Regularized Non-Negative Matrix Factorization for Lifelong Topic Modeling
abstract
Lifelong topic model (LTM), an emerging paradigm for never-ending topic learning, aims to yield higher-quality topics as time passes through knowledge accumulated from the past yet learned for the future. In this paper, we propose a novel lifelong topic model based on non-negative matrix factorization (NMF), called Affinity Regularized NMF for LTM (NMF-LTM), which to our best knowledge is distinctive from the popular LDA-based LTMs. NMF-LTM achieves lifelong learning by introducing word-word graph Laplacian as semantic affinity regularization. Other priors such as sparsity, diversity, and between-class affinity are incorporated as well for better performance, and a theoretical guarantee is provided for the algorithmic convergence to a local minimum. Extensive experiments on various public corpora demonstrate the effectiveness of NMF-LTM, particularly its human-like behaviors in two carefully designed learning tasks and the ability in topic modeling of big data. A further exploration of semantic relatedness in knowledge graphs and a case study on a large-scale real-world corpus exhibit the strength of NMF-LTM in discovering high-quality topics in an efficient and robust way.
Yong Chen 0008, Junjie Wu 0002, Jianying Lin, Rui Liu 0007, Hui Zhang 0028, Zhiwen Ye
IEEE Trans. Knowl. Data Eng.3
2019 Accurate prediction of potential druggable proteins based on genetic algorithm and Bagging-SVM ensemble classifier
Jianying Lin, Yushuang Liu, Bin Yu 0007
Artif. Intell. Medicine1
2019 Experimental explorations on short text topic mining between LDA and NMF based Schemes
Yong Chen 0008, Hui Zhang 0028, Rui Liu 0007, Zhiwen Ye, Jianying Lin
Knowl. Based Syst.5