Client segmentation under real-world constraints
Name
1126543884-MIT.pdf
Size
847.91 KB
Format
Adobe PDF
Checksum (MD5)
3a2ce48c4859157a9586af828b40d81a
Author(s)
Young, Gregory(Gregory F.)
Advisor(s)
Robert M. Freund and Sergei Lubensky.
Date Issued
2018
Publisher
Massachusetts Institute of Technology
Abstract
Market segmentation is a very useful tool that can enhance knowledge of a firm's customer base and therefore enable improved customer services and experiences that are more tailored to specific customer needs and preferences. Clustering is a natural and intuitive way to implement such segmentation, and in fact, there are a variety of standard methods by which to perform this. However, real-world considerations complicate its implementation, in particular, the necessity of not clustering in ways that could be considered discriminatory in terms of certain features such as gender or race. One way to mitigate such discriminatory clustering is through constraints that ensure that the clusters are balanced in terms of such features. However, such a clustering is barely, if at all, discussed in current literature. In this thesis, we develop and implement a new version of k-means clustering that is able to achieve comparable performance relative to an unconstrained clustering while at the same time address the constraints imposed by these discriminatory features.
Description
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 67-69).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission.
Persistent DSpace Link
