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.

Yutian Wen

dblp:167/4191 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2017
0000-0002-3457-2571ORCID · corroborated

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

Computer networks · 3 · 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.

Computer networks
3 papers
Wireless sensing and localization · 86% Network optimization and economics · 14%
Theoretical computer science
2 papers
Algorithmic game theory and mechanism design · 87% Information theory · 13%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

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

TopicWeightPapersLastEvidence papers
Wireless sensing and localization
indoor localization
0.522017
Performance Analysis of RSS Fingerprinting Based Indoor Localization · IEEE Trans. Mob. Comput. 2017
Fundamental limits of RSS fingerprinting based indoor localization · INFOCOM 2015
Wireless sensing and localization › indoor localization › fingerprint-based localization
RSS fingerprinting
0.522017
Performance Analysis of RSS Fingerprinting Based Indoor Localization · IEEE Trans. Mob. Comput. 2017
Fundamental limits of RSS fingerprinting based indoor localization · INFOCOM 2015
Wireless sensing and localization
localization performance analysis
0.312017
Performance Analysis of RSS Fingerprinting Based Indoor Localization · IEEE Trans. Mob. Comput. 2017
Network optimization and economics › mechanism design › incentive mechanism
crowdsourcing incentive mechanism
0.212015
Incentivize crowd labeling under budget constraint · INFOCOM 2015
Algorithmic game theory and mechanism design › auction theory › auction mechanism
reverse auction
0.212015
Incentivize crowd labeling under budget constraint · INFOCOM 2015
Algorithmic game theory and mechanism design › mechanism design
truthful mechanism
0.212015
Incentivize crowd labeling under budget constraint · INFOCOM 2015
Data mining › crowdsourcing
crowdsourced annotation
0.112015
Incentivize crowd labeling under budget constraint · INFOCOM 2015
Data mining › crowdsourcing
label aggregation
0.112015
Incentivize crowd labeling under budget constraint · INFOCOM 2015

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

probabilistic modeling · 0.7sequential bayesian aggregation · 0.7reverse auction · 0.7crowdsourcing · 0.4theoretical analysis · 0.3
YearPublicationVenuePosition
2017 Performance Analysis of RSS Fingerprinting Based Indoor Localization
abstract
Indoor localization has been an active research field for decades, where received signal strength (RSS) fingerprinting based methodology is widely adopted and induces many important localization techniques, such as the recently proposed one building fingerprints database with crowdsourcing. While efforts have been dedicated to improve accuracy and efficiency of localization, performance of the RSS fingerprinting based methodology itself is still unknown in a theoretical perspective. In this paper, we present a general probabilistic model to shed light on a fundamental issue: how good the RSS fingerprinting based indoor localization can achieve? Concretely, we present the probability that a user can be localized in a region with certain size. We reveal the interaction among accuracy, reliability, and the number of measurements in the localization process. Moreover, we present the optimal fingerprints reporting strategy that can achieve the best localization accuracy with given reliability and the number of measurements, which provides a design guideline for the RSS fingerprinting based indoor localization system. Further, we analyze the influence of imperfect database information on the reliability of localization, and find that the impact of imperfect information is still under control with reasonable number of samplings when building the database.
Xiaohua Tian, Ruofei Shen, Duowen Liu, Yutian Wen, Xinbing Wang
IEEE Trans. Mob. Comput.4
2015 Fundamental limits of RSS fingerprinting based indoor localization
abstract
Indoor localization has been an active research field for decades, where the received signal strength (RSS) fingerprinting based methodology is widely adopted and induces many important localization techniques such as the recently proposed one building the fingerprint database with crowd-sourcing. While efforts have been dedicated to improve the accuracy and efficiency of localization, the fundamental limits of RSS fingerprinting based methodology itself is still unknown in a theoretical perspective. In this paper, we present a general probabilistic model to shed light on a fundamental question: how good the RSS fingerprinting based indoor localization can achieve? Concretely, we present the probability that a user can be localized in a region with certain size, given the RSS fingerprints submitted to the system. We reveal the interaction among the localization accuracy, the reliability of location estimation and the number of measurements in the RSS fingerprinting based location determination. Moreover, we present the optimal fingerprints reporting strategy that can achieve the best accuracy for given reliability and the number of measurements, which provides a design guideline for the RSS fingerprinting based indoor localization facilitated by crowdsourcing paradigm.
Yutian Wen, Xiaohua Tian, Xinbing Wang, Songwu Lu
INFOCOM1
2015 Incentivize crowd labeling under budget constraint
abstract
Crowdsourcing systems allocate tasks to a group of workers over the Internet, which have become an effective paradigm for human-powered problem solving such as image classification, optical character recognition and proofreading. In this paper, we focus on incentivizing crowd workers to label a set of binary tasks under strict budget constraint. We properly profile the tasks' difficulty levels and workers' quality in crowdsourcing systems, where the collected labels are aggregated with sequential Bayesian approach. To stimulate workers to undertake crowd labeling tasks, the interaction between workers and the platform is modeled as a reverse auction. We reveal that the platform utility maximization could be intractable, for which an incentive mechanism that determines the winning bid and payments with polynomial-time computation complexity is developed. Moreover, we theoretically prove that our mechanism is truthful, individually rational and budget feasible. Through extensive simulations, we demonstrate that our mechanism utilizes budget efficiently to achieve high platform utility with polynomial computation complexity.
Qi Zhang 0038, Yutian Wen, Xiaohua Tian, Xiaoying Gan, Xinbing Wang
INFOCOM2