Demo Data from VLDB 2026 / reviewers in the wild / expert
Daniel S. Tkach
dblp:15/741
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 2011
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1Software engineering, systems software and programming languages · 1Databases, data management, data science and information retrieval · 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 |
Data mining · 50% Information retrieval · 50% | |
| Theoretical computer science
1 paper |
Graph algorithms and graph theory · 100% | |
| Software engineering, system software, and programming languages
1 paper |
Empirical software engineering · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data mining › structured data mining › graph mining
network ranking |
0.1 | 1 | 2011 | Performances and Characteristics of DIGRank, Ranking in the Incomplete Networks · ICDM 2011 |
Information retrieval
pagerank estimation |
0.1 | 1 | 2011 | Performances and Characteristics of DIGRank, Ranking in the Incomplete Networks · ICDM 2011 |
Graph algorithms and graph theory
network analysis |
0.0 | 1 | 2011 | Performances and Characteristics of DIGRank, Ranking in the Incomplete Networks · ICDM 2011 |
Empirical software engineering
technology transfer |
0.0 | 1 | 1993 | Strategies for Object-Oriented Technology Transfer (Panel) · OOPSLA 1993 |
Methods — techniques the papers use, named apart from their topics
mean field approach · 0.2DIGRank · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2011 | Performances and Characteristics of DIGRank, Ranking in the Incomplete NetworksabstractPage Rank has been widely used in ranking retrieval results on the web, finding the top influential papers in citation networks or detecting valuable users in online social networks. However, in practice, it is usually hard to obtain a complete structure of any above networks to rank nodes. Thus, some researchers have begun to explore how to get estimated ranks efficiently without acquiring the whole network. They have proposed some approximating methods, however, it is difficult to determine which method is the best one or which is suitable to a certain application. In this case, we set experiments in small-world and scale-free generated networks to certify the feasibility and characteristics of four approximating methods. We also use eleven real networks to mention different optimal conditions for these methods. We find the DIG Rank method performs better than other local estimation methods in almost every given sub graph. Besides, Mean field approach method tends to perform well in networks that have low average shortest path length, small amount of nodes with the same low in degree, or weak community structure. Finally, we apply the most versatile method DIG Rank to Sina micro-blog website to precisely classify users in a group as elites, grassroots or mummy users. Xiang Niu, Lusong Li, Xiaobing Xiong, Daniel S. Tkach, Ke Xu 0001 |
ICDM | 4 |
| 1993 | Strategies for Object-Oriented Technology Transfer (Panel)abstractarticle Free Access Share on Strategies for object-oriented technology transfer (panel) Authors: Dennis de Champeaux View Profile , Andrew J. Baer View Profile , Brian Bernsen View Profile , Alan R. Korncoff View Profile , Tim Korson View Profile , Daniel S. Tkach View Profile Authors Info & Claims ACM SIGPLAN NoticesVolume 28Issue 10Oct. 1, 1993 pp 437–447https://doi.org/10.1145/167962.165936Online:01 October 1993Publication History 0citation354DownloadsMetricsTotal Citations0Total Downloads354Last 12 Months7Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF Dennis de Champeaux, Andrew J. Baer, Brian Bernsen, Alan R. Korncoff, Timothy D. Korson, Daniel S. Tkach |
OOPSLA | 6 |