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

Jinsong Tan

dblp:17/3047 · DBLP profile ↗
← Back
10ranked-venue papers
7as first author
1since 2021 · last 2027
0009-0004-8653-0180ORCID · corroborated

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

Theory of computation · 7 · 6 first-authorArtificial intelligence and machine learning · 3 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 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.

Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%
Network and information security
1 paper
Privacy and data protection · 50% Network security · 50%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational social science and digital humanities · 100%

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

TopicWeightPapersLastEvidence papers
Computational social science and digital humanities
human subject experiments
0.112010
A behavioral study of bargaining in social networks · EC 2010
Algorithmic game theory and mechanism design › cooperative game theory
bargaining
0.112010
A behavioral study of bargaining in social networks · EC 2010
Algorithmic game theory and mechanism design › cooperative game theory
bargaining networks
0.112010
A behavioral study of bargaining in social networks · EC 2010
Network security
belief propagation
0.112007
Privacy-Preserving Belief Propagation and Sampling · NIPS 2007
Privacy and data protection › privacy-preserving computation
privacy-preserving distributed computation
0.112007
Privacy-Preserving Belief Propagation and Sampling · NIPS 2007

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

secure multiparty computation · 0.1
YearPublicationVenuePosition
2027 A scenario-adaptive blind channel estimation method for non-cooperative click-mimicking communication signals
Xiaozong Hou, Shefeng Yan, Qingwang Yao, Zhuochen Li, Zhaoming Li, Jinsong Tan, Weichen Kong, Hongkun Wang, Fajie Duan
Signal Process.8
2010 The Networked Common Goods Game
Jinsong Tan
COCOA (2)1
2010 A behavioral study of bargaining in social networks
abstract
We report on a series of highly controlled human subject experiments in networked bargaining. The basic interaction between two players is the decision of how to share a mutual payment; we extend this to situate the players in a network. Various theories predict, to different levels of uniqueness, what the shares will be. We analyze our experimental results from three points of view: social efficiency, nodal differences, and human differences; and contrast our behavioral results with the theories.
Tanmoy Chakraborty 0001, J. Stephen Judd, Michael Kearns, Jinsong Tan
EC4
2008 Inapproximability of Maximum Weighted Edge Biclique and Its Applications
Jinsong Tan
TAMC1
2008 A note on the inapproximability of correlation clustering
Jinsong Tan
Inf. Process. Lett.1
2007 Privacy-Preserving Belief Propagation and Sampling
abstract
We provide provably privacy-preserving versions of belief propagation, Gibbs sampling, and other local algorithms — distributed multiparty protocols in which each party or vertex learns only its final local value, and absolutely nothing else.
Michael Kearns, Jinsong Tan, Jennifer Wortman Vaughan
NIPS2
2007 Algorithmic and Complexity Issues of Three Clustering Methods in Microarray Data Analysis
Jinsong Tan, Kok Seng Chua, Louxin Zhang, Song Zhu
Algorithmica1
2007 The Consecutive Ones Submatrix Problem for Sparse Matrices
Jinsong Tan, Louxin Zhang
Algorithmica1
2005 Algorithmic and Complexity Issues of Three Clustering Methods in Microarray Data Analysis
Jinsong Tan, Kok Seng Chua, Louxin Zhang
COCOON1
2004 Approximation Algorithms for the Consecutive Ones Submatrix Problem on Sparse Matrices
Jinsong Tan, Louxin Zhang
ISAAC1