{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:59:28Z","timestamp":1743083968783,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030161415"},{"type":"electronic","value":"9783030161422"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-16142-2_26","type":"book-chapter","created":{"date-parts":[[2019,4,4]],"date-time":"2019-04-04T02:50:37Z","timestamp":1554346237000},"page":"327-345","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Maximizing Gain over Flexible Attributes in Peer to Peer Marketplaces"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5251-6186","authenticated-orcid":false,"given":"Abolfazl","family":"Asudeh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Azade","family":"Nazi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nick","family":"Koudas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gautam","family":"Das","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,20]]},"reference":[{"key":"26_CR1","unstructured":"Agrawal, R., Srikant, R., et al.: Fast algorithms for mining association rules. In: VLDB (1994)"},{"key":"26_CR2","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1057\/jors.1980.122","volume":"37","author":"S Albers","year":"1980","unstructured":"Albers, S., Brockhoff, K.: Optimal product attributes in single choice models. JORS 37, 647\u2013655 (1980)","journal-title":"JORS"},{"issue":"11","key":"26_CR3","first-page":"888","volume":"9","author":"A Asudeh","year":"2016","unstructured":"Asudeh, A., Zhang, N., Das, G.: Query reranking as a service. PVLDB 9(11), 888\u2013899 (2016)","journal-title":"PVLDB"},{"issue":"4","key":"26_CR4","first-page":"263","volume":"11","author":"DP Bertsekas","year":"1991","unstructured":"Bertsekas, D.P., \u00d6zveren, C., Stamoulis, G.D., Tseng, P., Tsitsiklis, J.N.: Optimal communication algorithms for hypercubes. JPDC 11(4), 263\u2013275 (1991)","journal-title":"JPDC"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Das, M., Das, G., Hristidis, V.: Leveraging collaborative tagging for web item design. In: SIGKDD (2011)","DOI":"10.1145\/2020408.2020493"},{"key":"26_CR6","first-page":"195","volume":"4","author":"M Ertz","year":"2016","unstructured":"Ertz, M., Durif, F.: Collaborative consumption or the rise of the two-sided consumer. J. Bus. Manage. 4, 195\u2013209 (2016)","journal-title":"J. Bus. Manage."},{"key":"26_CR7","unstructured":"Feldman, M., Izsak, R.: Constrained monotone function maximization and the supermodular degree. arXiv preprint arXiv:1407.6328 (2014)"},{"key":"26_CR8","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Gary","year":"1979","unstructured":"Gary, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/1071610.1071611","volume":"30","author":"F Geerts","year":"2005","unstructured":"Geerts, F., Goethals, B., Bussche, J.: Tight upper bounds on the number of candidate patterns. TODS 30, 333\u2013363 (2005)","journal-title":"TODS"},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1145\/777943.777945","volume":"28","author":"D Gunopulos","year":"2013","unstructured":"Gunopulos, D., Khardon, R., Mannila, H., Saluja, S., Toivonen, H., Sharma, R.S.: Discovering all most specific sentences. TODS 28, 140\u2013174 (2013)","journal-title":"TODS"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: SIGMOD. ACM (2000)","DOI":"10.1145\/342009.335372"},{"key":"26_CR12","unstructured":"Lhote, L., Rioult, F., Soulet, A.: Average number of frequent (closed) patterns in Bernoulli and Markovian databases. In: ICDM. IEEE (2005)"},{"key":"26_CR13","first-page":"959","volume":"21","author":"M Miah","year":"2009","unstructured":"Miah, M., Das, G., Hristidis, V., Mannila, H.: Determining attributes to maximize visibility of objects. TKDE 21, 959\u2013973 (2009)","journal-title":"TKDE"},{"issue":"3","key":"26_CR14","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0167-6377(02)00122-0","volume":"30","author":"DJ Rader Jr.","year":"2002","unstructured":"Rader Jr., D.J., Woeginger, G.J.: The quadratic 0\u20131 knapsack problem with series-parallel support. Oper. Res. Lett. 30(3), 159\u2013166 (2002)","journal-title":"Oper. Res. Lett."},{"key":"26_CR15","unstructured":"Asudeh, A., Nazi, A., Koudas, N., Das, G.: Assisting service providers in peer-to-peer marketplaces: maximizing gain over flexible attributes. CoRR, abs\/1705.03028 (2017)"},{"key":"26_CR16","unstructured":"Rymon, R.: Search through systematic set enumeration (1992)"},{"key":"26_CR17","doi-asserted-by":"publisher","first-page":"880","DOI":"10.1147\/sj.393.0880","volume":"39","author":"T Selker","year":"2000","unstructured":"Selker, T., Burleson, W.: Context-aware design and interaction in computer systems. IBM Syst. J. 39, 880\u2013891 (2000)","journal-title":"IBM Syst. J."},{"key":"26_CR18","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1287\/mnsc.20.6.921","volume":"20","author":"AD Shocker","year":"1974","unstructured":"Shocker, A.D., Srinivasan, V.: A consumer-based methodology for the identification of new product ideas. Manage. Sci. 20, 921\u2013937 (1974)","journal-title":"Manage. Sci."},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"Witzgall, C.: Mathematical methods of site selection for electronic message systems (EMS). NASA STI\/Recon Tech, Report (1975)","DOI":"10.6028\/NBS.IR.75-737"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-16142-2_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T12:21:03Z","timestamp":1709814063000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-16142-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030161415","9783030161422"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-16142-2_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"20 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Macau","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.pakdd2019.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Microsoft Conf. Man. Toolkit CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"542","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"137","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.79","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5.85","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"In addition, there were 31 PAKDD 2019 Workshops' papers accepted for publication","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}