Demo Data from EDBT 2026 / reviewers in the wild / expert
Qi Guo 0003
dblp:67/398-3
· DBLP profile ↗
5ranked-venue papers
1as first author
0since 2021 · last 2020
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 1 first-authorDatabases, data management, data science and information retrieval · 3Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 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 |
Recommender systems · 50% Information retrieval · 50% | |
| Artificial intelligence
1 paper |
Question answering and dialogue systems · 50% Knowledge representation and reasoning · 50% |
Topics — the 2 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Knowledge, reasoning and agents › Knowledge representation and reasoning › knowledge management
knowledge evaluation |
0.2 | 1 | 2016 | Questimator: Generating Knowledge Assessments for Arbitrary Topics · IJCAI 2016 |
Natural language and speech › Question answering and dialogue systems
question generation |
0.2 | 1 | 2016 | Questimator: Generating Knowledge Assessments for Arbitrary Topics · IJCAI 2016 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | DeText: A Deep Text Ranking Framework with BERTabstractRanking is the most important component in a search system. Most search systems deal with large amounts of natural language data, hence an effective ranking system requires a deep understanding of text semantics. Recently, deep learning based natural language processing (deep NLP) models have generated promising results on ranking systems. BERT is one of the most successful models that learn contextual embedding, which has been applied to capture complex query-document relations for search ranking. However, this is generally done by exhaustively interacting each query word with each document word, which is inefficient for online serving in search product systems. In this paper, we investigate how to build an efficient BERT-based ranking model for industry use cases. The solution is further extended to a general ranking framework, DeText, that is open sourced and can be applied to various ranking productions. Offline and online experiments of DeText on three real-world search systems present significant improvement over state-of-the-art approaches. Weiwei Guo, Sida Wang 0002, Huiji Gao, Ananth Sankar, Zimeng Yang, Qi Guo 0003, Liang Zhang 0021, Bo Long, Bee-Chung Chen, Deepak Agarwal |
CIKM | 7 |
| 2018 | Towards Deep and Representation Learning for Talent Search at LinkedInabstractTalent search and recommendation systems at LinkedIn strive to match the potential candidates to the hiring needs of a recruiter or a hiring manager expressed in terms of a search query or a job posting. Recent work in this domain has mainly focused on linear models, which do not take complex relationships between features into account, as well as ensemble tree models, which introduce non-linearity but are still insufficient for exploring all the potential feature interactions, and strictly separate feature generation from modeling. In this paper, we present the results of our application of deep and representation learning models on LinkedIn Recruiter. Our key contributions include: (i) Learning semantic representations of sparse entities within the talent search domain, such as recruiter ids, candidate ids, and skill entity ids, for which we utilize neural network models that take advantage of LinkedIn Economic Graph, and (ii) Deep models for learning recruiter engagement and candidate response in talent search applications. We also explore learning to rank approaches applied to deep models, and show the benefits for the talent search use case. Finally, we present offline and online evaluation results for LinkedIn talent search and recommendation systems, and discuss potential challenges along the path to a fully deep model architecture. The challenges and approaches discussed generalize to any multi-faceted search engine. Rohan Ramanath, Hakan Inan, Gungor Polatkan, Qi Guo 0003, Cagri Ozcaglar, Xianren Wu, Krishnaram Kenthapadi, Sahin Cem Geyik |
CIKM | 5 |
| 2018 | Talent Search and Recommendation Systems at LinkedIn: Practical Challenges and Lessons LearnedabstractIn this talk, we present the overall system design and architecture, the challenges encountered in practice, and the lessons learned from the production deployment of the talent search and recommendation systems at LinkedIn. By presenting our experiences of applying techniques at the intersection of recommender systems, information retrieval, machine learning, and statistical modeling in a large-scale industrial setting and highlighting the open problems, we hope to stimulate further research and collaborations within the SIGIR community. Sahin Cem Geyik, Qi Guo 0003, Cagri Ozcaglar, Ketan Thakkar, Xianren Wu, Krishnaram Kenthapadi |
SIGIR | 2 |
| 2018 | Epileptic Seizure Classification of EEGs Using Time-Frequency Analysis Based Multiscale Radial Basis FunctionsabstractThe automatic detection of epileptic seizures from electroencephalography (EEG) signals is crucial for the localization and classification of epileptic seizure activity. However, seizure processes are typically dynamic and nonstationary, and thus, distinguishing rhythmic discharges from nonstationary processes is one of the challenging problems. In this paper, an adaptive and localized time-frequency representation in EEG signals is proposed by means of multiscale radial basis functions (MRBF) and a modified particle swarm optimization (MPSO) to improve both time and frequency resolution simultaneously, which is a novel MRBF-MPSO framework of the time-frequency feature extraction for epileptic EEG signals. The dimensionality of extracted features can be greatly reduced by the principle component analysis algorithm before the most discriminative features selected are fed into a support vector machine (SVM) classifier with the radial basis function (RBF) in order to separate epileptic seizure from seizure-free EEG signals. The classification performance of the proposed method has been evaluated by using several state-of-art feature extraction algorithms and other five different classifiers like linear discriminant analysis, and logistic regression. The experimental results indicate that the proposed MRBF-MPSO-SVM classification method outperforms competing techniques in terms of classification accuracy, and shows the effectiveness of the proposed method for classification of seizure epochs and seizure-free epochs. Yang Li 0010, Xu-Dong Wang, Mei-Lin Luo, Xiao-Feng Yang, Qi Guo 0003 |
IEEE J. Biomed. Health Informatics | 6 |
| 2016 | Questimator: Generating Knowledge Assessments for Arbitrary Topics
Qi Guo 0003, Chinmay Kulkarni 0001, Aniket Kittur, Jeffrey P. Bigham, Emma Brunskill |
IJCAI | 1 |