{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:41:49Z","timestamp":1725536509400},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642033476"},{"type":"electronic","value":"9783642033483"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03348-3_45","type":"book-chapter","created":{"date-parts":[[2009,8,8]],"date-time":"2009-08-08T05:01:20Z","timestamp":1249707680000},"page":"461-468","source":"Crossref","is-referenced-by-count":1,"title":["Predicting Click Rates by Consistent Bipartite Spectral Graph Model"],"prefix":"10.1007","author":[{"given":"Wensheng","family":"Guo","sequence":"first","affiliation":[]},{"given":"Guohe","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"45_CR1","unstructured":"Regelson, M., Fain, D.C.: Predicting click-through rate using keyword clusters. In: Richardson, M., Dominowska, E., Ragno, R. (eds.) Proceedings of the Second Workshop on Sponsored Search Auctions (2006)"},{"key":"45_CR2","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1145\/1242572.1242643","volume-title":"Proceedings of the 16th International Conference on World Wide Web (WWW 2007)","author":"M. Richardson","year":"2007","unstructured":"Richardson, M., Dominowska, E., Ragno, R.: Predicting clicks: estimating the click-through rate for new ads. In: Proceedings of the 16th International Conference on World Wide Web (WWW 2007), pp. 521\u2013530. ACM, New York (2007)"},{"key":"45_CR3","unstructured":"Dembczynski, K., Kotlowski, W., Weiss, D.: Predicting Ads\u2019 Click-Through Rate with Decision Rules. In: Proceedings of the 17th International Conference on World Wide Web (WWW 2008), Beijing, China (2008)"},{"issue":"12","key":"45_CR4","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/1035134.1035162","volume":"47","author":"R. Kumar","year":"2004","unstructured":"Kumar, R., Novak, J., Raghavan, P., Tomkins, A.: Structure and evolution of blogspace. Communications of the ACM\u00a047(12), 35\u201339 (2004)","journal-title":"Communications of the ACM"},{"key":"45_CR5","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1145\/502512.502551","volume-title":"Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining (KDD 2001)","author":"C. Ding","year":"2001","unstructured":"C.H.Q., Ding, X., He, and H., Zha.: A spectral method to separate disconnected and nearly-disconnected web graph components. In: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining(KDD \u201901), pp. 275\u2013280. New York, NY, USA, ACM Press (2001)"},{"key":"45_CR6","doi-asserted-by":"crossref","unstructured":"Gao, B., Liu, T.Y., Zheng, X., Cheng, Q.S., Ma, W.Y.: Consistent Bipartite Graph Co-Partitioning for Star-Structured High-Order Heterogeneous Data Co-Clustering. In: Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, New York, NY, USA, pp. 41\u201350","DOI":"10.1145\/1081870.1081879"},{"key":"45_CR7","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1145\/1065167.1065192","volume-title":"Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (PODS 20905)","author":"D. Cheng","year":"2005","unstructured":"Cheng, D., Vempala, S., Kannan, R., Wang, G.: A divide-and-merge methodology for clustering. In: Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (PODS 20905), USA, pp. 196\u2013205. ACM Press, New York (2005)"},{"issue":"23","key":"45_CR8","doi-asserted-by":"crossref","first-page":"298","DOI":"10.21136\/CMJ.1973.101168","volume":"1973","author":"M. Fiedler","year":"1973","unstructured":"Fiedler, M.: Algebraic connectivity of graphs. Czech Math. J.\u00a01973(23), 298\u2013305 (1973)","journal-title":"Czech Math. J."}],"container-title":["Lecture Notes in Computer Science","Advanced Data Mining and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03348-3_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,9]],"date-time":"2021-10-09T13:32:47Z","timestamp":1633786367000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03348-3_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642033476","9783642033483"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03348-3_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}