Name
Abstract | ||
|---|---|---|
Crowdclustering clusters data items in a crowdsourcing manner, which makes discovered item categories more consistent with human perception. However, due to diversity of crowdsourcing workers and fluctuation of the number of tasks assigned to each worker, inferring stable and reliable clusters is challenging. Moreover, an item may be associated with multiple attributes, and such items should be put into different clusters, which makes inferring accurate clusters more complicated. To address the challenges above, in this paper we present a robust and fast crowdclustering scheme for finding overlapping clusters of items. Distinguished from existing works, we extract reliable and stable cluster information from workers' answers by majority voting. We then formulate an optimization problem to find overlapping clusters, and develop a nonnegative matrix factorization based approach to approximate the optimal solution. Experiments show the robustness, accuracy and efficiency of our approach. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1109/ICC.2016.7511257 | 2016 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC) |
Field | DocType | ISSN |
Resource management,Data mining,Cluster (physics),Crowdsourcing,Computer science,Robustness (computer science),Redundancy (engineering),Non-negative matrix factorization,Majority rule,Optimization problem | Conference | 1550-3607 |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| You Wu | 1 | 0 | 0.34 |
| Xiong Wang | 2 | 70 | 5.15 |
| Zhe Yang | 3 | 10 | 1.27 |
| Xiaoying Gan | 4 | 344 | 48.16 |
| Xiaohua Tian | 5 | 568 | 65.92 |
| Xinbing Wang | 6 | 2642 | 214.43 |