{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T21:10:02Z","timestamp":1744233002105,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642305665"},{"type":"electronic","value":"9783642305672"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30567-2_38","type":"book-chapter","created":{"date-parts":[[2012,10,1]],"date-time":"2012-10-01T07:10:40Z","timestamp":1349075440000},"page":"449-463","source":"Crossref","is-referenced-by-count":5,"title":["FLMin: An Approach for Mining Frequent Links in Social Networks"],"prefix":"10.1007","author":[{"given":"Erick","family":"Stattner","sequence":"first","affiliation":[]},{"given":"Martine","family":"Collard","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"38_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: International Conference on Very Large Data Bases (1994)"},{"key":"38_CR2","doi-asserted-by":"crossref","unstructured":"Altman, A., Tennenholtz, M.: Ranking systems: the pagerank axioms. In: ACM Conference on Electronic Commerce, pp. 1\u20138 (2005)","DOI":"10.1145\/1064009.1064010"},{"key":"38_CR3","unstructured":"Barabasi, A.L.: Linked: The New Science of Networks. Perseus Books (2002)"},{"key":"38_CR4","doi-asserted-by":"crossref","unstructured":"Barrett, C.L., Bisset, K.R., Eubank, S.G., Feng, X., Marathe, M.V.: Episimdemics: an efficient algorithm for simulating the spread of infectious disease over large realistic social networks. In: Conference on Supercomputing, pp. 1\u201312 (2008)","DOI":"10.1109\/SC.2008.5214892"},{"key":"38_CR5","series-title":"LNBIP","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-642-00670-8_8","volume-title":"Enterprise Information Systems","author":"L. Brisson","year":"2009","unstructured":"Brisson, L., Collard, M.: How to Semantically Enhance a Data Mining Process? In: Filipe, J., Cordeiro, J. (eds.) ICEIS 2008. LNBIP, vol.\u00a019, pp. 103\u2013116. Springer, Heidelberg (2009)"},{"key":"38_CR6","doi-asserted-by":"crossref","unstructured":"Cheng, H., Yan, X., Han, J.: Mining graph patterns. In: Managing and Mining Graph Data, pp. 365\u2013392 (2010)","DOI":"10.1007\/978-1-4419-6045-0_12"},{"key":"38_CR7","doi-asserted-by":"crossref","unstructured":"Chua, F.C.T., Lauw, H.W., Lim, E.-P.: Predicting item adoption using social correlation. In: SDM, pp. 367\u2013378 (2011)","DOI":"10.1137\/1.9781611972818.32"},{"key":"38_CR8","unstructured":"Collard, M., Vansnick, J.: How to measure interestingness in data mining: a multiple criteria decision analysis approach. In: RCIS, pp. 395\u2013400 (2007)"},{"key":"38_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/1117454.1117456","volume":"7","author":"L. Getoor","year":"2005","unstructured":"Getoor, L., Diehl, C.P.: Link mining: a survey. SIGKDD Explor.\u00a07, 3\u201312 (2005)","journal-title":"SIGKDD Explor."},{"key":"38_CR10","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-45372-5_2","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"A. Inokuchi","year":"2000","unstructured":"Inokuchi, A., Washio, T., Motoda, H.: An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data. In: Zighed, D.A., Komorowski, J., \u017bytkow, J.M. (eds.) PKDD 2000. LNCS (LNAI), vol.\u00a01910, pp. 13\u201323. Springer, Heidelberg (2000)"},{"key":"38_CR11","doi-asserted-by":"crossref","unstructured":"Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: Proceedings of the 2001 IEEE International Conference on Data Mining, pp. 313\u2013320 (2001)","DOI":"10.1109\/ICDM.2001.989534"},{"key":"38_CR12","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10618-005-0003-9","volume":"11","author":"M. Kuramochi","year":"2005","unstructured":"Kuramochi, M., Karypis, G.: Finding frequent patterns in a large sparse graph. Data Min. Knowl. Discov.\u00a011, 243\u2013271 (2005)","journal-title":"Data Min. Knowl. Discov."},{"key":"38_CR13","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1002\/asi.20591","volume":"58","author":"D. Liben-Nowell","year":"2007","unstructured":"Liben-Nowell, D., Kleinberg, J.: The link-prediction problem for social networks. J. Am. Soc. Inf. Sci. Technol.\u00a058, 1019\u20131031 (2007)","journal-title":"J. Am. Soc. Inf. Sci. Technol."},{"issue":"1","key":"38_CR14","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.entcs.2004.12.039","volume":"127","author":"S. Nijssen","year":"2005","unstructured":"Nijssen, S., Kok, J.N.: The gaston tool for frequent subgraph mining. Electr. Notes Theor. Comput. Sci.\u00a0127(1), 77\u201387 (2005)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"38_CR15","unstructured":"Yan, X., Han, J.: gspan: Graph-based substructure pattern mining. In: Proceedings of the 2002 IEEE International Conference on Data Mining (2002)"},{"key":"38_CR16","doi-asserted-by":"crossref","unstructured":"Yoon, S., Song, S., Kim, S.: Efficient link-based clustering in a large scaled blog network. In: Ubiquitous Information Management and Communication (2011)","DOI":"10.1145\/1968613.1968699"}],"container-title":["Communications in Computer and Information Science","Networked Digital Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30567-2_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T20:55:57Z","timestamp":1744232157000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30567-2_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642305665","9783642305672"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30567-2_38","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2012]]}}}