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

Junting Ye

dblp:132/3504 · DBLP profile ↗
← Back
9ranked-venue papers
6as first author
0since 2021 · last 2019
—ORCID · none

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

Databases, data management, data science and information retrieval · 8 · 6 first-authorArtificial intelligence and machine learning · 6 · 4 first-authorHuman-computer interaction and ubiquitous computing · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

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
Web and social media mining · 67% Information retrieval · 33%
Artificial intelligence
2 papers
Information extraction and text analysis · 77% Graph learning · 23%

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

TopicWeightPapersLastEvidence papers
Information retrieval
ranking
0.412019
MediaRank: Computational Ranking of Online News Sources · KDD 2019
Web and social media mining
social media analysis
0.412019
The Secret Lives of Names?: Name Embeddings from Social Media · KDD 2019
Natural language and speech › Information extraction and text analysis › text classification
ideology detection
0.312018
Multi-view Models for Political Ideology Detection of News Articles · EMNLP 2018

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

embedding learning · 0.8social bot detection · 0.4citation graph analysis · 0.4advertisement analysis · 0.4representation learning · 0.3multi-view learning · 0.3attention · 0.3
YearPublicationVenuePosition
2019 MediaRank: Computational Ranking of Online News Sources
abstract
In the recent political climate, the topic of news quality has drawn attention both from the public and the academic communities. The growing distrust of traditional news media makes it harder to find a common base of accepted truth. In this work, we design and build MediaRank (urlwww.media-rank.com ), a fully automated system to rank over 50,000 online news sources around the world. MediaRank collects and analyzes one million news webpages and two million related tweets everyday. We base our algorithmic analysis on four properties journalists have established to be associated with reporting quality: peer reputation, reporting bias/breadth, bottomline financial pressure, and popularity. Our major contributions of this paper include: (i) Open, interpretable quality rankings for over 50,000 of the world's major news sources. Our rankings are validated against 35 published news rankings, including French, German, Russian, and Spanish language sources. MediaRank scores correlate positively with 34 of 35 of these expert rankings. (ii) New computational methods for measuring influence and bottomline pressure. To the best of our knowledge, we are the first to study the large-scale news reporting citation graph in-depth. We also propose new ways to measure the aggressiveness of advertisements and identify social bots, establishing a connection between both types of bad behavior. (iii) Analyzing the effect of media source bias and significance. We prove that news sources cite others despite different political views in accord with quality measures. However, in four English-speaking countries (US, UK, Canada, and Australia), the highest ranking sources all disproportionately favor left-wing parties, even when the majority of news sources exhibited conservative slants.
Junting Ye, Steven Skiena
KDD1
2019 The Secret Lives of Names?: Name Embeddings from Social Media
abstract
Your name tells a lot about you: your gender, ethnicity and so on. It has been shown that name embeddings are more effective in representing names than traditional substring features. However, our previous name embedding model is trained on private email data and are not publicly accessible. In this paper, we explore learning name embeddings from public Twitter data. We argue that Twitter embeddings have two key advantages: (i) they can and will be publicly released to support research community. (ii) even with a smaller training corpus, Twitter embeddings achieve similar performances on multiple tasks comparing to email embeddings.
Junting Ye, Steven Skiena
KDD1
2018 Multi-view Models for Political Ideology Detection of News Articles
abstract
A news article's title, content and link structure often reveal its political ideology.However, most existing works on automatic political ideology detection only leverage textual cues.Drawing inspiration from recent advances in neural inference, we propose a novel attention based multi-view model to leverage cues from all of the above views to identify the ideology evinced by a news article.Our model draws on advances in representation learning in natural language processing and network science to capture cues from both textual content and the network structure of news articles.We empirically evaluate our model against a battery of baselines and show that our model outperforms state of the art by 10 percentage points F1 score.
Vivek Kulkarni, Junting Ye, Steven Skiena, William Yang Wang
EMNLP2
2018 Robust Semi-Supervised Learning on Multiple Networks with Noise
Junting Ye, Leman Akoglu
PAKDD (1)1
2017 Nationality Classification Using Name Embeddings
abstract
Nationality identification unlocks important demographic information, with many applications in biomedical and sociological research. Existing name-based nationality classifiers use name substrings as features and are trained on small, unrepresentative sets of labeled names, typically extracted from Wikipedia. As a result, these methods achieve limited performance and cannot support fine-grained classification.
Junting Ye, Shuchu Han, Yifan Hu 0001, Baris Coskun, Meizhu Liu, Hong Qin 0001, Steven Skiena
CIKM1
2016 Temporal Opinion Spam Detection by Multivariate Indicative Signals
Junting Ye, Santhosh Kumar, Leman Akoglu
ICWSM1
2015 Discovering Opinion Spammer Groups by Network Footprints
Junting Ye, Leman Akoglu
ECML/PKDD (1)1
2015 Dynamic author name disambiguation for growing digital libraries
Ya-nan Qian, Tetsuya Sakai, Junting Ye, Jun Liu 0002
Inf. Retr. J.4
2013 Dynamic query intent mining from a search log stream
abstract
It has long been recognized that search queries are often broad and ambiguous. Even when submitting the same query, different users may have different search intents. Moreover, the intents are dynamically evolving. Some intents are constantly popular with users, others are more bursty. We propose a method for mining dynamic query intents from search query logs. By regarding the query logs as a data stream, we identify constant intents while quickly capturing new bursty intents. To evaluate the accuracy and efficiency of our method, we conducted experiments using 50 topics from the NTCIR INTENT-9 data and additional five popular topics, all supplemented with six-month query logs from a commercial search engine. Our results show that our method can accurately capture new intents with short response time.
Ya-nan Qian, Tetsuya Sakai, Junting Ye
CIKM3