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.

Soo-Min Chae

dblp:20/8024 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2010
—ORCID · none

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

Databases, data management, data science and information retrieval · 1Applied, 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
Information retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Information retrieval
citation analysis
0.112010
Yet another paper ranking algorithm advocating recent publications · WWW 2010
Information retrieval › search engines › semantic search › entity retrieval › entity ranking
paper ranking
0.112010
Yet another paper ranking algorithm advocating recent publications · WWW 2010
Information retrieval
ranking
0.112010
Yet another paper ranking algorithm advocating recent publications · WWW 2010
Information retrieval › web search
scholarly search
0.112010
Yet another paper ranking algorithm advocating recent publications · WWW 2010

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

citation-based ranking · 0.1authority propagation · 0.1
YearPublicationVenuePosition
2010 Yet another paper ranking algorithm advocating recent publications
abstract
In this paper, we propose a new paper ranking algorithm that gives a high rank to papers which is credited by other authoritative papers or published in premier conferences or journals. Also, the proposed algorithm solves a problem that recent papers are rated poorly due to few citations.
Won-Seok Hwang, Soo-Min Chae, Sang-Wook Kim, Gyun Woo
WWW2