iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://api.crossref.org/works/10.1145/1014052.1014119
{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T20:46:07Z","timestamp":1725655567659},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2004,8,22]]},"DOI":"10.1145\/1014052.1014119","type":"proceedings-article","created":{"date-parts":[[2004,10,7]],"date-time":"2004-10-07T17:39:48Z","timestamp":1097170788000},"update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["A microeconomic data mining problem"],"prefix":"10.1145","author":[{"given":"Martin","family":"Ester","sequence":"first","affiliation":[{"name":"Simon Fraser University, Burnaby, B.C., Canada"}]},{"given":"Rong","family":"Ge","sequence":"additional","affiliation":[{"name":"Simon Fraser University, Burnaby, B.C., Canada"}]},{"given":"Wen","family":"Jin","sequence":"additional","affiliation":[{"name":"Simon Fraser University, Burnaby, B.C., Canada"}]},{"given":"Zengjian","family":"Hu","sequence":"additional","affiliation":[{"name":"Simon Fraser University, Burnaby, B.C., Canada"}]}],"member":"320","published-online":{"date-parts":[[2004,8,22]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"IBM synthetic data generator","author":"Agrawal R.","year":"1994","unstructured":"R. Agrawal . IBM synthetic data generator . 1994 . R.Agrawal. IBM synthetic data generator. 1994."},{"key":"e_1_3_2_1_2_1","unstructured":"V.Asodi and S.Safra. On the complexity of the catalog segmentation problem. Unpublished manuscript V.Asodi and S.Safra. On the complexity of the catalog segmentation problem. Unpublished manuscript"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347156"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"e_1_3_2_1_5_1","volume-title":"Computers and Intractability, a guide to the Theory of NP-completeness","author":"Garey M.R.","year":"1979","unstructured":"M.R. Garey and D.S. Johnson . Computers and Intractability, a guide to the Theory of NP-completeness . W.H. Freeman and company, 1979 . M.R.Garey and D.S.Johnson. Computers and Intractability, a guide to the Theory of NP-completeness. W.H. Freeman and company, 1979."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276860"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009726428407"},{"key":"e_1_3_2_1_8_1","volume-title":"Proc. of PAKDD","author":"Lin T.Y.","year":"2002","unstructured":"T.Y. Lin , Y.Y. Yao and E. Louie . Mining values added association rules . In Proc. of PAKDD 2002 . T.Y.Lin, Y.Y.Yao and E.Louie. Mining values added association rules. In Proc. of PAKDD 2002."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/846183.846191"},{"key":"e_1_3_2_1_10_1","volume-title":"G.Karypis and V.Kumar. Efficient Algorithms for Creating Product Catalogs. In Proc. of SDM","author":"Steinbach M.","year":"2001","unstructured":"M. Steinbach , G.Karypis and V.Kumar. Efficient Algorithms for Creating Product Catalogs. In Proc. of SDM 2001 . M.Steinbach, G.Karypis and V.Kumar. Efficient Algorithms for Creating Product Catalogs. In Proc. of SDM 2001."},{"key":"e_1_3_2_1_11_1","volume-title":"Proc. of ICDM","author":"Wong R.C.W.","year":"2003","unstructured":"R.C.W. Wong , A.W.C. Fu and K. Wang . MPIS : Maximal-profit item selection with cross-selling considerations . In Proc. of ICDM 2003 . R.C.W.Wong, A.W.C.Fu and K.Wang. MPIS: Maximal-profit item selection with cross-selling considerations. In Proc. of ICDM 2003."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775144"},{"key":"e_1_3_2_1_13_1","unstructured":"D.Xu Y.Ye and J.Zhang. Approximate the 2-Catalog Segmentation Problem Using Semidefinite Programming Relaxations. In Optimization Methods and Software. D.Xu Y.Ye and J.Zhang. Approximate the 2-Catalog Segmentation Problem Using Semidefinite Programming Relaxations. In Optimization Methods and Software."},{"key":"e_1_3_2_1_14_1","volume-title":"Proc. of EBDT","author":"Wang K.","year":"2002","unstructured":"K. Wang , S.Q. Zhou and J.W. Han . Profit Mining : From Patterns to Actions . In Proc. of EBDT 2002 . K.Wang, S.Q.Zhou and J.W.Han. Profit Mining: From Patterns to Actions. In Proc. of EBDT 2002."}],"event":{"name":"KDD04: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Seattle WA USA","acronym":"KDD04","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1014052.1014119","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T17:25:38Z","timestamp":1673544338000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1014052.1014119"}},"subtitle":["customer-oriented catalog segmentation"],"short-title":[],"issued":{"date-parts":[[2004,8,22]]},"references-count":14,"alternative-id":["10.1145\/1014052.1014119","10.1145\/1014052"],"URL":"https:\/\/doi.org\/10.1145\/1014052.1014119","relation":{},"subject":[],"published":{"date-parts":[[2004,8,22]]},"assertion":[{"value":"2004-08-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}