Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/2783258.2788589acmconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
research-article

Client Clustering for Hiring Modeling in Work Marketplaces

Published: 10 August 2015 Publication History

Abstract

An important problem that online work marketplaces face is grouping clients into clusters, so that in each cluster clients are similar with respect to their hiring criteria. Such a separation allows the marketplace to "learn" more accurately the hiring criteria in each cluster and recommend the right contractor to each client, for a successful collaboration. We propose a Maximum Likelihood definition of the "optimal" client clustering along with an efficient Expectation-Maximization clustering algorithm that can be applied in large marketplaces. Our results on the job hirings at oDesk over a seven-month period show that our client-clustering approach yields significant gains compared to "learning" the same hiring criteria for all clients. In addition, we analyze the clustering results to find interesting differences between the hiring criteria in the different groups of clients.

Supplementary Material

MP4 File (p2187.mp4)

References

[1]
G. M. Allenby and P. E. Rossi. Marketing models of consumer heterogeneity. J. Econometrics, 89:57--78, 1998.
[2]
D. M. Blei, A. Y. Ng, and M. I. Jordan. Latent dirichlet allocation. J. Machine Learning Research, 3:993--1022, 2003.
[3]
R. Collobert, S. Bengio, and Y. Bengio. A parallel mixture of SVMs for very large scale problems. In NIPS, 2002.
[4]
M. Daltayanni, L. de Alfaro, and P. Papadimitriou. Workerrank: Using employer implicit judgements to infer worker reputation. In WSDM, 2015.
[5]
A. S. Das, M. Datar, A. Garg, and S. Rajaram. Google news personalization: Scalable online collaborative filtering. In WWW, 2007.
[6]
O. Dekel and O. Shamir. There's a hole in my data space: Piecewise predictors for heterogeneous learning problems. In AISTATS, 2012.
[7]
M. Deodhar and J. Ghosh. Scoal: A framework for simultaneous co-clustering and learning from complex data. ACM Trans. Knowl. Discov. Data, 4(3):11:1--11:31, 2010.
[8]
W. DeSarbo and W. Cron. A maximum likelihood methodology for clusterwise linear regression. J. of Classification, 5(2):249--282, 1988.
[9]
Z. Fu, A. Robles-Kelly, and J. Zhou. Mixing Linear SVMs for Nonlinear Classification. IEEE Trans. Neural Networks, 21(12):1963--1975, 2010.
[10]
T. George and S. Merugu. A scalable collaborative filtering framework based on co-clustering. In ICDM, 2005.
[11]
J. L. Herlocker, J. A. Konstan, A. Borchers, and J. Riedl. An algorithmic framework for performing collaborative filtering. In SIGIR, 1999.
[12]
T. Hofmann. Latent semantic models for collaborative filtering. ACM Trans. Information Systems, 22:89--115, 2004.
[13]
K. Hu, W. Hsu, and M. L. Lee. Utilizing users' tipping points in e-commerce recommender systems. In ICDE, 2013.
[14]
S. in Lee, H. Lee, P. Abbeel, and A. Y. Ng. Efficient l1 regularized logistic regression. In AAAI, 2006.
[15]
W. A. Kamakura and G. Russell. A probabilistic choice model for market segmentation and elasticity structure. J. Marketing Research, XXVI:379--390, 1989.
[16]
M. J. Kearns, Y. Mansour, and A. Y. Ng. An information-theoretic analysis of hard and soft assignment methods for clustering. In UAI, 1997.
[17]
K. Koh, S.-J. Kim, and S. Boyd. An interior-point method for large-scale l1-regularized logistic regression. J. Machine Learning Research, 8:1519--1555, 2007.
[18]
M. Kokkodis, P. Papadimitriou, and P. G. Ipeirotis. Hiring behavior models for online labor markets. In WSDM, 2015.
[19]
Y. Koren. Factorization meets the neighborhood: A multifaceted collaborative filtering model. In KDD, 2008.
[20]
P. J. Lenk, W. S. DeSarbo, P. E. Green, and M. R. Young. Hierarchical bayes conjoint analysis: Recovery of partworth heterogeneity from reduced experimental designs. Marketing Science, 15:173--191, 1996.
[21]
J. J. Levandoski, M. Sarwat, A. Eldawy, and M. F. Mokbel. Lars: A location-aware recommender system. In ICDE, 2012.
[22]
G. Mclachlan and D. Peel. Finite Mixture Models. Wiley, 2000.
[23]
D. C. J. Pradeep K. Chintagunta and N. J. Vilcassim. Investigating heterogeneity in brand preferences in logit models for panel data. J. Marketing Research, 28:417--428, 1991.
[24]
R. Salakhutdinov and A. Mnih. Probabilistic matrix factorization. In NIPS, 2007.
[25]
R. Salakhutdinov, A. Mnih, and G. Hinton. Restricted boltzmann machines for collaborative filtering. In ICML, 2007.
[26]
B. Sarwar, G. Karypis, J. Konstan, and J. Riedl. Item-based collaborative filtering recommendation algorithms. In WWW, 2001.
[27]
H. Sp\"ath. Algorithm 39 clusterwise linear regression. Computing, 22(4), 1979.
[28]
X. Su and T. M. Khoshgoftaar. A survey of collaborative filtering techniques. Advances in Artificial Intelligence, 2009.
[29]
V. Verroios, P. Papadimitriou, R. Johari, and H. Garcia-Molina. Client clustering for hiring modeling in work marketplaces. Technical report, Stanford University, available at http://ilpubs.stanford.edu:8090/1106/.
[30]
M. Wedel and J.-B. E. M. Steenkamp. A clusterwise regression method for simultaneous fuzzy market structuring and benefit segmentation. J. Marketing Research, 28(4):385--396, 1991.
[31]
J. Yuan, B. Kanagal, V. Josifovski, L. Garcia-Pueyo, A. Ahmed, and S. Pandey. Focused matrix factorization for audience selection in display advertising. In ICDE, 2013.
[32]
J. Zhu, N. Chen, and E. Xing. Infinite svm: a dirichlet process mixture of large-margin kernel machines. In ICML, 2011.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
KDD '15: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
August 2015
2378 pages
ISBN:9781450336642
DOI:10.1145/2783258
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 10 August 2015

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. client clustering
  2. crowdsourcing
  3. hiring criteria
  4. hiring modeling
  5. job marketplaces
  6. logistic regression clustering
  7. outsourcing
  8. sparse logistic regression
  9. work marketplaces

Qualifiers

  • Research-article

Conference

KDD '15
Sponsor:

Acceptance Rates

KDD '15 Paper Acceptance Rate 160 of 819 submissions, 20%;
Overall Acceptance Rate 1,133 of 8,635 submissions, 13%

Upcoming Conference

KDD '25

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)0
Reflects downloads up to 02 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2020)Hiring Secretaries over TimeMathematics of Operations Research10.1287/moor.2019.099345:1(323-352)Online publication date: 1-Feb-2020
  • (2019)Big Data Enables Labor Market IntelligenceEncyclopedia of Big Data Technologies10.1007/978-3-319-77525-8_276(226-236)Online publication date: 20-Feb-2019
  • (2018)Big Data Enables Labor Market IntelligenceEncyclopedia of Big Data Technologies10.1007/978-3-319-63962-8_276-1(1-11)Online publication date: 1-Feb-2018
  • (2016)A harmony and disharmony in mining of the migrating individuals2016 Third International Conference on Digital Information Processing, Data Mining, and Wireless Communications (DIPDMWC)10.1109/DIPDMWC.2016.7529363(52-57)Online publication date: Jul-2016
  • (2016)Migration of the IndividualsProcedia Computer Science10.1016/j.procs.2016.07.44988(359-364)Online publication date: 2016

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media