On Participation Constrained Team Formation
The task assignment on the Internet has been widely applied to many areas, e.g., online labor market, online paper review and social activity organization. In this paper, we are concerned with the task assignment problem related to the online labor market, termed as CLUSTERHIRE. We improve the defin...
Gespeichert in:
| Veröffentlicht in: | Journal of computer science and technology 2017, Vol.32 (1), p.139-154 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 154 |
|---|---|
| container_issue | 1 |
| container_start_page | 139 |
| container_title | Journal of computer science and technology |
| container_volume | 32 |
| creator | Zhou, Yu Huang, Jian-Bin Jia, Xiao-Lin Sun, He-Li |
| description | The task assignment on the Internet has been widely applied to many areas, e.g., online labor market, online paper review and social activity organization. In this paper, we are concerned with the task assignment problem related to the online labor market, termed as CLUSTERHIRE. We improve the definition of the CLUSTERHIRE problem, and propose an efficient and effective algorithm, entitled INFLUENCE. In addition, we place a participation constraint on CLUSTERHIRE. It constrains the load of each expert in order to keep all members from overworking. For the participation-constrained CLUSTERHIRE problem, we devise two algorithms, named PROJECTFIRST and ERA. The former generates a participation- constrained team by adding experts to an initial team, and the latter generates a participation-constrained team by removing the experts with the minimum influence from the universe of experts. The experimental evaluations indicate that 1） INFLU- ENCE performs better than the state-of-the-art algorithms in terms of effectiveness and time efficiency; 2） PROJECTFIRST performs better than ERA in terms of time efficiency, yet ERA performs better than PROJECTFIRST in terms of effectiveness. |
| doi_str_mv | 10.1007/s11390-017-1710-6 |
| format | Article |
| fullrecord | <record><control><sourceid>wanfang_jour_proqu</sourceid><recordid>TN_cdi_wanfang_journals_jsjkxjsxb_e201701012</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><cqvip_id>671282245</cqvip_id><wanfj_id>jsjkxjsxb_e201701012</wanfj_id><sourcerecordid>jsjkxjsxb_e201701012</sourcerecordid><originalsourceid>FETCH-LOGICAL-c461t-4e6c665ea529d7b6343738a8ac2f5fef53c6e6649b3f2fc7fc35817c8f4a1db03</originalsourceid><addsrcrecordid>eNp9kE9LAzEQxRdRsP75AN6KXgRdnUmyyeYoxaog6EHPIZsmddc22yZbrN_e6JYiHrxMBvJ77zEvy04QrhBAXEdEKiEHFDkKhJzvZAMsOeRMMLmbdgDIZRr72UGMDQAVwNggu3jyw2cdutrUC93VrR-OWh-7oGtvJ8MXq-fDcRvmP19H2Z7Ts2iPN-9h9jq-fRnd549Pdw-jm8fcMI5dziw3nBdWF0RORMUpo4KWutSGuMJZV1DDLedMVtQRZ4QztChRmNIxjZMK6GF22ft-aO-0n6qmXQWfElUTm_d1E9eVsiSdCghIEn7e44vQLlc2dmpeR2NnM-1tu4oKSyGlBCpZQs_-oFtrLAue7ITARGFPmdDGGKxTi1DPdfhUCOq7bdW3rRKuvttWPGlIr4mJ9VMbfjn_IzrdBL21frpMum0SF0hKQlhBvwBDM4tQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1856101771</pqid></control><display><type>article</type><title>On Participation Constrained Team Formation</title><source>Springer Nature - Complete Springer Journals</source><creator>Zhou, Yu ; Huang, Jian-Bin ; Jia, Xiao-Lin ; Sun, He-Li</creator><creatorcontrib>Zhou, Yu ; Huang, Jian-Bin ; Jia, Xiao-Lin ; Sun, He-Li</creatorcontrib><description>The task assignment on the Internet has been widely applied to many areas, e.g., online labor market, online paper review and social activity organization. In this paper, we are concerned with the task assignment problem related to the online labor market, termed as CLUSTERHIRE. We improve the definition of the CLUSTERHIRE problem, and propose an efficient and effective algorithm, entitled INFLUENCE. In addition, we place a participation constraint on CLUSTERHIRE. It constrains the load of each expert in order to keep all members from overworking. For the participation-constrained CLUSTERHIRE problem, we devise two algorithms, named PROJECTFIRST and ERA. The former generates a participation- constrained team by adding experts to an initial team, and the latter generates a participation-constrained team by removing the experts with the minimum influence from the universe of experts. The experimental evaluations indicate that 1） INFLU- ENCE performs better than the state-of-the-art algorithms in terms of effectiveness and time efficiency; 2） PROJECTFIRST performs better than ERA in terms of time efficiency, yet ERA performs better than PROJECTFIRST in terms of effectiveness.</description><identifier>ISSN: 1000-9000</identifier><identifier>EISSN: 1860-4749</identifier><identifier>DOI: 10.1007/s11390-017-1710-6</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Algorithms ; Artificial Intelligence ; Assignment problem ; Computer Science ; Constraints ; Data Structures and Information Theory ; Effectiveness ; Efficiency ; Hiring ; Information Systems Applications (incl.Internet) ; Internet ; Labor ; Labor market ; Markets ; Operations research ; Participation ; Regular Paper ; Skills ; Social networks ; Social research ; Software Engineering ; Studies ; Tasks ; Teams ; Theory of Computation ; Universe ; 互联网 ; 任务分配问题 ; 劳动力市场 ; 文件审查 ; 时间效率 ; 活动组织 ; 算法 ; 队形</subject><ispartof>Journal of computer science and technology, 2017, Vol.32 (1), p.139-154</ispartof><rights>Springer Science+Business Media New York 2017</rights><rights>Springer Science+Business Media New York 2017.</rights><rights>Copyright © Wanfang Data Co. Ltd. All Rights Reserved.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c461t-4e6c665ea529d7b6343738a8ac2f5fef53c6e6649b3f2fc7fc35817c8f4a1db03</citedby><cites>FETCH-LOGICAL-c461t-4e6c665ea529d7b6343738a8ac2f5fef53c6e6649b3f2fc7fc35817c8f4a1db03</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttp://image.cqvip.com/vip1000/qk/85226X/85226X.jpg</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s11390-017-1710-6$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s11390-017-1710-6$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,776,780,4010,27900,27901,27902,41464,42533,51294</link.rule.ids></links><search><creatorcontrib>Zhou, Yu</creatorcontrib><creatorcontrib>Huang, Jian-Bin</creatorcontrib><creatorcontrib>Jia, Xiao-Lin</creatorcontrib><creatorcontrib>Sun, He-Li</creatorcontrib><title>On Participation Constrained Team Formation</title><title>Journal of computer science and technology</title><addtitle>J. Comput. Sci. Technol</addtitle><addtitle>Journal of Computer Science and Technology</addtitle><description>The task assignment on the Internet has been widely applied to many areas, e.g., online labor market, online paper review and social activity organization. In this paper, we are concerned with the task assignment problem related to the online labor market, termed as CLUSTERHIRE. We improve the definition of the CLUSTERHIRE problem, and propose an efficient and effective algorithm, entitled INFLUENCE. In addition, we place a participation constraint on CLUSTERHIRE. It constrains the load of each expert in order to keep all members from overworking. For the participation-constrained CLUSTERHIRE problem, we devise two algorithms, named PROJECTFIRST and ERA. The former generates a participation- constrained team by adding experts to an initial team, and the latter generates a participation-constrained team by removing the experts with the minimum influence from the universe of experts. The experimental evaluations indicate that 1） INFLU- ENCE performs better than the state-of-the-art algorithms in terms of effectiveness and time efficiency; 2） PROJECTFIRST performs better than ERA in terms of time efficiency, yet ERA performs better than PROJECTFIRST in terms of effectiveness.</description><subject>Algorithms</subject><subject>Artificial Intelligence</subject><subject>Assignment problem</subject><subject>Computer Science</subject><subject>Constraints</subject><subject>Data Structures and Information Theory</subject><subject>Effectiveness</subject><subject>Efficiency</subject><subject>Hiring</subject><subject>Information Systems Applications (incl.Internet)</subject><subject>Internet</subject><subject>Labor</subject><subject>Labor market</subject><subject>Markets</subject><subject>Operations research</subject><subject>Participation</subject><subject>Regular Paper</subject><subject>Skills</subject><subject>Social networks</subject><subject>Social research</subject><subject>Software Engineering</subject><subject>Studies</subject><subject>Tasks</subject><subject>Teams</subject><subject>Theory of Computation</subject><subject>Universe</subject><subject>互联网</subject><subject>任务分配问题</subject><subject>劳动力市场</subject><subject>文件审查</subject><subject>时间效率</subject><subject>活动组织</subject><subject>算法</subject><subject>队形</subject><issn>1000-9000</issn><issn>1860-4749</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNp9kE9LAzEQxRdRsP75AN6KXgRdnUmyyeYoxaog6EHPIZsmddc22yZbrN_e6JYiHrxMBvJ77zEvy04QrhBAXEdEKiEHFDkKhJzvZAMsOeRMMLmbdgDIZRr72UGMDQAVwNggu3jyw2cdutrUC93VrR-OWh-7oGtvJ8MXq-fDcRvmP19H2Z7Ts2iPN-9h9jq-fRnd549Pdw-jm8fcMI5dziw3nBdWF0RORMUpo4KWutSGuMJZV1DDLedMVtQRZ4QztChRmNIxjZMK6GF22ft-aO-0n6qmXQWfElUTm_d1E9eVsiSdCghIEn7e44vQLlc2dmpeR2NnM-1tu4oKSyGlBCpZQs_-oFtrLAue7ITARGFPmdDGGKxTi1DPdfhUCOq7bdW3rRKuvttWPGlIr4mJ9VMbfjn_IzrdBL21frpMum0SF0hKQlhBvwBDM4tQ</recordid><startdate>2017</startdate><enddate>2017</enddate><creator>Zhou, Yu</creator><creator>Huang, Jian-Bin</creator><creator>Jia, Xiao-Lin</creator><creator>Sun, He-Li</creator><general>Springer US</general><general>Springer Nature B.V</general><general>School of Computer Science and Technology, Xidian University, Xi’an 710071, China%School of Software, Xidian University, Xi’an 710071, China%Department of Computer Science and Technology, Xi’an Jiaotong University, Xi’an 710049, China</general><scope>2RA</scope><scope>92L</scope><scope>CQIGP</scope><scope>W92</scope><scope>~WA</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>8AL</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>L6V</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0C</scope><scope>M0N</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>Q9U</scope><scope>2B.</scope><scope>4A8</scope><scope>92I</scope><scope>93N</scope><scope>PSX</scope><scope>TCJ</scope></search><sort><creationdate>2017</creationdate><title>On Participation Constrained Team Formation</title><author>Zhou, Yu ; Huang, Jian-Bin ; Jia, Xiao-Lin ; Sun, He-Li</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c461t-4e6c665ea529d7b6343738a8ac2f5fef53c6e6649b3f2fc7fc35817c8f4a1db03</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Algorithms</topic><topic>Artificial Intelligence</topic><topic>Assignment problem</topic><topic>Computer Science</topic><topic>Constraints</topic><topic>Data Structures and Information Theory</topic><topic>Effectiveness</topic><topic>Efficiency</topic><topic>Hiring</topic><topic>Information Systems Applications (incl.Internet)</topic><topic>Internet</topic><topic>Labor</topic><topic>Labor market</topic><topic>Markets</topic><topic>Operations research</topic><topic>Participation</topic><topic>Regular Paper</topic><topic>Skills</topic><topic>Social networks</topic><topic>Social research</topic><topic>Software Engineering</topic><topic>Studies</topic><topic>Tasks</topic><topic>Teams</topic><topic>Theory of Computation</topic><topic>Universe</topic><topic>互联网</topic><topic>任务分配问题</topic><topic>劳动力市场</topic><topic>文件审查</topic><topic>时间效率</topic><topic>活动组织</topic><topic>算法</topic><topic>队形</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Zhou, Yu</creatorcontrib><creatorcontrib>Huang, Jian-Bin</creatorcontrib><creatorcontrib>Jia, Xiao-Lin</creatorcontrib><creatorcontrib>Sun, He-Li</creatorcontrib><collection>中文科技期刊数据库</collection><collection>中文科技期刊数据库-CALIS站点</collection><collection>中文科技期刊数据库-7.0平台</collection><collection>中文科技期刊数据库-工程技术</collection><collection>中文科技期刊数据库- 镜像站点</collection><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ProQuest Engineering Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Engineering Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>One Business (ProQuest)</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><collection>ProQuest Central Basic</collection><collection>Wanfang Data Journals - Hong Kong</collection><collection>WANFANG Data Centre</collection><collection>Wanfang Data Journals</collection><collection>万方数据期刊 - 香港版</collection><collection>China Online Journals (COJ)</collection><collection>China Online Journals (COJ)</collection><jtitle>Journal of computer science and technology</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Zhou, Yu</au><au>Huang, Jian-Bin</au><au>Jia, Xiao-Lin</au><au>Sun, He-Li</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On Participation Constrained Team Formation</atitle><jtitle>Journal of computer science and technology</jtitle><stitle>J. Comput. Sci. Technol</stitle><addtitle>Journal of Computer Science and Technology</addtitle><date>2017</date><risdate>2017</risdate><volume>32</volume><issue>1</issue><spage>139</spage><epage>154</epage><pages>139-154</pages><issn>1000-9000</issn><eissn>1860-4749</eissn><abstract>The task assignment on the Internet has been widely applied to many areas, e.g., online labor market, online paper review and social activity organization. In this paper, we are concerned with the task assignment problem related to the online labor market, termed as CLUSTERHIRE. We improve the definition of the CLUSTERHIRE problem, and propose an efficient and effective algorithm, entitled INFLUENCE. In addition, we place a participation constraint on CLUSTERHIRE. It constrains the load of each expert in order to keep all members from overworking. For the participation-constrained CLUSTERHIRE problem, we devise two algorithms, named PROJECTFIRST and ERA. The former generates a participation- constrained team by adding experts to an initial team, and the latter generates a participation-constrained team by removing the experts with the minimum influence from the universe of experts. The experimental evaluations indicate that 1） INFLU- ENCE performs better than the state-of-the-art algorithms in terms of effectiveness and time efficiency; 2） PROJECTFIRST performs better than ERA in terms of time efficiency, yet ERA performs better than PROJECTFIRST in terms of effectiveness.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s11390-017-1710-6</doi><tpages>16</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1000-9000 |
| ispartof | Journal of computer science and technology, 2017, Vol.32 (1), p.139-154 |
| issn | 1000-9000 1860-4749 |
| language | eng |
| recordid | cdi_wanfang_journals_jsjkxjsxb_e201701012 |
| source | Springer Nature - Complete Springer Journals |
| subjects | Algorithms Artificial Intelligence Assignment problem Computer Science Constraints Data Structures and Information Theory Effectiveness Efficiency Hiring Information Systems Applications (incl.Internet) Internet Labor Labor market Markets Operations research Participation Regular Paper Skills Social networks Social research Software Engineering Studies Tasks Teams Theory of Computation Universe 互联网 任务分配问题 劳动力市场 文件审查 时间效率 活动组织 算法 队形 |
| title | On Participation Constrained Team Formation |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-30T14%3A20%3A46IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-wanfang_jour_proqu&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20Participation%20Constrained%20Team%20Formation&rft.jtitle=Journal%20of%20computer%20science%20and%20technology&rft.au=Zhou,%20Yu&rft.date=2017&rft.volume=32&rft.issue=1&rft.spage=139&rft.epage=154&rft.pages=139-154&rft.issn=1000-9000&rft.eissn=1860-4749&rft_id=info:doi/10.1007/s11390-017-1710-6&rft_dat=%3Cwanfang_jour_proqu%3Ejsjkxjsxb_e201701012%3C/wanfang_jour_proqu%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1856101771&rft_id=info:pmid/&rft_cqvip_id=671282245&rft_wanfj_id=jsjkxjsxb_e201701012&rfr_iscdi=true |