{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:51:47Z","timestamp":1725519107928},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540878766"},{"type":"electronic","value":"9783540878773"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87877-3_4","type":"book-chapter","created":{"date-parts":[[2008,10,11]],"date-time":"2008-10-11T07:30:56Z","timestamp":1223710256000},"page":"26-40","source":"Crossref","is-referenced-by-count":1,"title":["Developing Preference Band Model to Manage Collective Preferences"],"prefix":"10.1007","author":[{"given":"Wilfred","family":"Ng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: Ranking and clustering. In: ACM STOC, pp. 684\u2013693 (2005)","DOI":"10.1145\/1060590.1060692"},{"issue":"4","key":"4_CR2","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1145\/958942.958946","volume":"28","author":"J. Chomicki","year":"2003","unstructured":"Chomicki, J.: Preference formulas in relational queries. ACM Transaction Database System\u00a028(4), 427\u2013466 (2003)","journal-title":"ACM Transaction Database System"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Fagin, R., Kumar, R., Mahdian, M.: Comparing and aggregating with ties. In: ACM PODS, pp. 47\u201358 (2004)","DOI":"10.1145\/1055558.1055568"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Feng, J., Fang, Q., Ng, W.: Discovering Bucket Orders from Full Rankings. In: ACM SIGMOD (2008)","DOI":"10.1145\/1376616.1376625"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Gionis, A., Mannila, H., Puolamaki, K., Ukkonen, A.: Algorithms for discovering bucket orders from data. In: ACM SIGKDD, pp. 561\u2013566 (2006)","DOI":"10.1145\/1150402.1150468"},{"key":"4_CR6","unstructured":"Goharian, N., Jain, A., Sun, Q.: Comparative analysis of sparse matrix algorithms for information retrieval. Journal of Sys., Cyb. and Inf.\u00a01(1) (2003)"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Kie\u00dfling, W., K\u00f6stler, G.: Foundations of Preference in Database Systems. In: Proc. of VLDB (2002)","DOI":"10.1016\/B978-155860869-6\/50035-4"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-540-75563-0_19","volume-title":"Conceptual Modeling - ER 2007","author":"W. Ng","year":"2007","unstructured":"Ng, W.: Prioritized Preferences and Choice Constraints. In: Parent, C., Schewe, K.-D., Storey, V.C., Thalheim, B. (eds.) ER 2007. LNCS, vol.\u00a04801, pp. 261\u2013276. Springer, Heidelberg (2007)"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/978-3-540-24571-1_48","volume-title":"Database Systems for Advanced Applications","author":"Q. Tan","year":"2004","unstructured":"Tan, Q., et al.: Applying Co-training to Clickthrough Data for Search Engine Adaptation. In: Lee, Y., Li, J., Whang, K.-Y., Lee, D. (eds.) DASFAA 2004. LNCS, vol.\u00a02973, pp. 519\u2013532. Springer, Heidelberg (2004)"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Puolam\u00e4ki, K., Fortelius, M., Mannila, H.: Seriation in paleontological data using markov chain monte carlo methods. PLoS Computational Bioglogy\u00a02(2) (2006)","DOI":"10.1371\/journal.pcbi.0020006"},{"key":"4_CR11","unstructured":"van Zuylen, A., et al.: Deterministic pivoting algorithms for constrained ranking and clustering problems. In: ACM-SIAM SODA, pp. 405\u2013414 (2007)"}],"container-title":["Lecture Notes in Computer Science","Conceptual Modeling - ER 2008"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87877-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T11:22:11Z","timestamp":1557832931000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-87877-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540878766","9783540878773"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87877-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}