{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,19]],"date-time":"2024-01-19T18:59:20Z","timestamp":1705690760388},"reference-count":7,"publisher":"Association for Computing Machinery (ACM)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2013,8,28]]},"abstract":"<jats:p>Many telco analytics require maintaining call profiles based on recent customer call patterns. Such call profiles are typically organized as aggregations computed at different time scales over the recent customer interactions. Customer call profiles are key inputs for analytics targeted at improving operations, marketing, and sales of telco providers. Many of these analytics require clustering customer call profiles, so that customers with similar calling patterns can be modeled as a group. Example applications include optimizing tariffs, customer segmentation, and usage forecasting. In this demo, we present our system for scalable aggregate profile clustering in a streaming setting. We focus on managing anonymized segments of customers for tariff optimization. Due to the large number of customers, maintaining profile clusters have high processing and memory resource requirements. In order to tackle this problem, we apply distributed stream processing. However, in the presence of distributed state, it is a major challenge to partition the profiles over machines (nodes) such that memory and computation balance is maintained, while keeping the clustering accuracy high. Furthermore, to adapt to potentially changing customer calling patterns, the partitioning of profiles to machines should be continuously revised, yet one should minimize the migration of profiles so as not to disturb the online processing of updates. We provide a re-partitioning technique that achieves all these goals. We keep micro-cluster summaries at each node, collect these summaries at a centralize node, and use a greedy algorithm with novel affinity heuristics to revise the partitioning. We present a demo that showcases our Storm and Hbase based implementation of the proposed solution in the context of a customer segmentation application.<\/jats:p>","DOI":"10.14778\/2536274.2536284","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"1234-1237","source":"Crossref","is-referenced-by-count":12,"title":["Aggregate profile clustering for telco analytics"],"prefix":"10.14778","volume":"6","author":[{"given":"Mehmet Ali","family":"Abbaso\u011flu","sequence":"first","affiliation":[{"name":"Computer Engineering Department, Bilkent University, Ankara, Turkey and Korvus Bili\u015fim R&amp;D, Ankara, Turkey"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bu\u011fra","family":"Gedik","sequence":"additional","affiliation":[{"name":"Computer Engineering Department, Bilkent University, Ankara, Turkey"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hakan","family":"Ferhatosmano\u011flu","sequence":"additional","affiliation":[{"name":"Computer Engineering Department, Bilkent University, Ankara, Turkey"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,8]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"81","volume-title":"Very Large Databases Conference (VLDB)","author":"Aggarwal C. C.","year":"2003","unstructured":"C. C. Aggarwal , J. Han , J. Wang , and P. S. Yu . A framework for clustering evolving data streams . In Very Large Databases Conference (VLDB) , pages 81 - 92 , 2003 . C. C. Aggarwal, J. Han, J. Wang, and P. S. Yu. A framework for clustering evolving data streams. In Very Large Databases Conference (VLDB), pages 81-92, 2003."},{"key":"e_1_2_1_2_1","volume-title":"http:\/\/hbase.apache.org\/. retrieved","year":"2013","unstructured":"HBase. http:\/\/hbase.apache.org\/. retrieved March , 2013 . HBase. http:\/\/hbase.apache.org\/. retrieved March, 2013."},{"issue":"2","key":"e_1_2_1_3_1","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1509\/jmkr.40.2.225.19227","article-title":"Multi-criterion clusterwise regression for joint segmentation settings: An application to customer value","volume":"40","author":"Brusco M. J.","year":"2003","unstructured":"M. J. Brusco , J. D. Cradit , and A. Tashchian . Multi-criterion clusterwise regression for joint segmentation settings: An application to customer value . Journal of Marketing Research , 40 ( 2 ): 225 - 234 , 2003 . M. J. Brusco, J. D. Cradit, and A. Tashchian. Multi-criterion clusterwise regression for joint segmentation settings: An application to customer value. Journal of Marketing Research, 40(2):225-234, 2003.","journal-title":"Journal of Marketing Research"},{"key":"e_1_2_1_4_1","first-page":"226","volume-title":"ACM International Conference on Knowledge Discovery and Data Mining (KDD)","author":"Ester M.","year":"1996","unstructured":"M. Ester , H.-P. Kriegel , J. Sander , and X. Xu . A density-based algorithm for discovering clusters in large spatial databases with noise . In ACM International Conference on Knowledge Discovery and Data Mining (KDD) , pages 226 - 231 , 1996 . M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases with noise. In ACM International Conference on Knowledge Discovery and Data Mining (KDD), pages 226-31, 1996."},{"issue":"3","key":"e_1_2_1_6_1","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1016\/j.eswa.2005.09.080","article-title":"Applying data mining to telecom churn management","volume":"31","author":"Hung S.-Y.","year":"2006","unstructured":"S.-Y. Hung , D. C. Yen , and H.-Y. Wang . Applying data mining to telecom churn management . Expert Systems with Applications , 31 ( 3 ): 515 - 524 , 2006 . S.-Y. Hung, D. C. Yen, and H.-Y. Wang. Applying data mining to telecom churn management. Expert Systems with Applications, 31(3):515-524, 2006.","journal-title":"Expert Systems with Applications"},{"key":"e_1_2_1_7_1","first-page":"727","volume-title":"International Conference on Machine Learning (ICML)","author":"Pelleg D.","year":"2000","unstructured":"D. Pelleg and A. W. Moore . X-means: Extending k-means with efficient estimation of the number of clusters . In International Conference on Machine Learning (ICML) , pages 727 - 734 , 2000 . D. Pelleg and A. W. Moore. X-means: Extending k-means with efficient estimation of the number of clusters. In International Conference on Machine Learning (ICML), pages 727-734, 2000."},{"key":"e_1_2_1_8_1","volume-title":"http:\/\/storm-project.net\/. retrieved","year":"2013","unstructured":"Storm. http:\/\/storm-project.net\/. retrieved March , 2013 . Storm. http:\/\/storm-project.net\/. retrieved March, 2013."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2536274.2536284","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:53:46Z","timestamp":1672224826000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2536274.2536284"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8]]},"references-count":7,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2013,8,28]]}},"alternative-id":["10.14778\/2536274.2536284"],"URL":"https:\/\/doi.org\/10.14778\/2536274.2536284","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2013,8]]}}}