{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:06:46Z","timestamp":1725563206689},"publisher-location":"Vienna","reference-count":27,"publisher":"Springer Vienna","isbn-type":[{"type":"print","value":"9783709102930"},{"type":"electronic","value":"9783709102947"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-7091-0294-7_6","type":"book-chapter","created":{"date-parts":[[2010,8,25]],"date-time":"2010-08-25T09:12:05Z","timestamp":1282727525000},"page":"95-115","source":"Crossref","is-referenced-by-count":0,"title":["Integrating Entropy and Closed Frequent Pattern Mining for Social Network Modelling and Analysis"],"prefix":"10.1007","author":[{"given":"Muhaimenul","family":"Adnan","sequence":"first","affiliation":[]},{"given":"Reda","family":"Alhajj","sequence":"additional","affiliation":[]},{"given":"Jon","family":"Rokne","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"R. Agrawal, T. Imielinski, and A. N. Swami, \u201cMining association rules between sets of items in large databases,\u201d in SIGMOD Conference, 1993, pp. 207\u2013216.","DOI":"10.1145\/170035.170072"},{"key":"6_CR2","unstructured":"R. Agrawal, M. Mehta, J. C. Shafer, R. Srikant, A. Arning, and T. Bollinger, \u201cThe quest data mining system,\u201d in KDD, 1996, pp. 244\u2013249."},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1145\/775047.775110","volume-title":"KDD\u2019 02: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining","author":"F. Beil","year":"2002","unstructured":"F. Beil, M. Ester, and X. Xu, \u201cFrequent term-based text clustering,\u201d in KDD\u2019 02: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining. New York, NY, USA: ACM, 2002, pp. 436\u2013442."},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1145\/1242572.1242586","volume-title":"WWW\u2019 07: Proceedings of the 16th international conference on World Wide Web.","author":"G. Carenini","year":"2007","unstructured":"G. Carenini, R. T. Ng, and X. Zhou, \u201cSummarizing email conversations with clue words,\u201d in WWW\u2019 07: Proceedings of the 16th international conference on World Wide Web. New York, NY, USA: ACM, 2007, pp. 91\u2013100."},{"key":"6_CR5","unstructured":"M. R. De, J.-R. D., and M. D. L., \u201cThe mahalanobis distance,\u201d Chemometrics and Intelligent Laboratory Systems, vol. 50, no. 1, January."},{"issue":"3","key":"6_CR6","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1109\/2.989932","volume":"35","author":"G. W. Flake","year":"2002","unstructured":"G. W. Flake, S. Lawrence, C. L. Giles, and F. M. Coetzee, \u201cSelf-organization and identification of web communities,\u201d Computer, vol. 35, no. 3, pp. 66\u201371, 2002.","journal-title":"Computer"},{"issue":"12","key":"6_CR7","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M. Girvan","year":"2002","unstructured":"M. Girvan and M. E. J. Newman, \u201cCommunity structure in social and biological networks,\u201d PNAS, vol. 99, no. 12, pp. 7821\u20137826, June 2002.","journal-title":"PNAS"},{"key":"6_CR8","unstructured":"G. Grahne and J. Zhu, \u201cEfficiently using prefix-trees in mining frequent itemsets,\u201d in FIMI, 2003."},{"key":"6_CR9","unstructured":"P. S. Keila and D. B. Skillicorn, \u201cDetecting unusual email communication,\u201d in CASCON\u2019 05: Proceedings of the 2005 conference of the. Centre for Advanced Studies on collaborative research. IBM Press. 2005. pp. 117\u2013125."},{"key":"6_CR10","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B. W. Kernighan","year":"1970","unstructured":"B. W. Kernighan and S. Lin, \u201cAn efficient heuristic procedure for partitioning graphs,\u201d Bell System Tech. Journal, vol. 49, pp. 291\u2013307, February 1970.","journal-title":"Bell System Tech. Journal"},{"key":"6_CR11","unstructured":"F. M. Khan, T. A. Fisher, L. Shuler, T. Wu, and W. M. Pottenger, \u201cMining chat-room conversations for social and semantic interactions,\u201d Lehigh University, Bethlehem, PA. Tech. Rep. LU-CSE-02-011, 2002."},{"key":"6_CR12","first-page":"281","volume":"1","author":"J. MacQueen","year":"1967","unstructured":"J. MacQueen, \u201cSome methods for classification and analysis of multivariate observations,\u201d Proc. of Fifth Berkeley Symp. on Mathematical Statistics and Probability, vol. 1, pp. 281\u2013297, 1967.","journal-title":"Proc. of Fifth Berkeley Symp. on Mathematical Statistics and Probability"},{"issue":"1","key":"6_CR13","first-page":"49","volume":"2","author":"P. C. Mahalanobis","year":"1936","unstructured":"P. C. Mahalanobis, \u201cOn the generalised distance in statistics,\u201d in Proceedings National Institute of Science. India, vol. 2, no. 1, April 1936, pp. 49\u201355. [Online]. Available: http:\/\/ir.isical.ac.in\/dspace\/handle\/1\/1268","journal-title":"Proceedings National Institute of Science. India"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"1092","DOI":"10.1145\/1062745.1062884","volume-title":"WWW\u2019 05: Special interest tracks and posters of the 14th international conference on World Wide","author":"N. Matsumura","year":"2005","unstructured":"N. Matsumura, D. E. Goldberg, and X. Llor\u00e0, \u201cMining directed social network from message board,\u201d in WWW\u2019 05: Special interest tracks and posters of the 14th international conference on World Wide Web. New York, NY, USA: ACM, 2005, pp. 1092\u20131093."},{"key":"6_CR15","unstructured":"P. Mika, \u201cBootstrapping the foaf-web: An experiment in social network mining,\u201d in Proc. of the 1st Workshop Friend of a Friend. Social Networking and the Semantic Web, Galway, Ireland, 2004, pp. 1\u20132."},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/1148170.1148179","volume-title":"SIGIR\u2019 06: Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval","author":"E. Minkov","year":"2006","unstructured":"E. Minkov, W. W. Cohen, and A. Y. Ng, \u201cContextual search and name disambiguation in email using graphs,\u201d in SIGIR\u2019 06: Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval. New York, NY, USA: ACM, 2006, pp. 27\u201334."},{"issue":"7043","key":"6_CR17","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1038\/nature03607","volume":"435","author":"G. Palla","year":"2005","unstructured":"G. Palla, I. Derenyi, I. Farkas, and T. Vicsek, \u201cUncovering the overlapping community structure of complex networks in nature and society,\u201d Nature, vol. 435, no. 7043, pp. 814\u2013818, June 2005.","journal-title":"Nature"},{"key":"6_CR18","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1007\/3-540-49257-7_25","volume-title":"ICDT\u2019 99: Proceedings of the 7th International Conference on Database Theory","author":"N. Pasquier","year":"1999","unstructured":"N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, \u201cDiscovering frequent closed itemsets for association rules,\u201d in ICDT\u2019 99: Proceedings of the 7th International Conference on Database Theory. London, UK: Springer-Verlag, 1999, pp. 398\u2013416."},{"issue":"9","key":"6_CR19","doi-asserted-by":"publisher","first-page":"2658","DOI":"10.1073\/pnas.0400054101","volume":"101","author":"F. Radicchi","year":"2004","unstructured":"F. Radicchi, C. Castellano, F. Cecconi, V. Loreto, and D. Parisi, \u201cDefining and identifying communities in networks,\u201d PNAS, vol. 101, no. 9, pp. 2658\u20132663, March 2004.","journal-title":"PNAS"},{"key":"6_CR20","unstructured":"J. Scott, Social Network Analysis: A Handbook, 2nd ed. Sage Publications, 2000."},{"key":"6_CR21","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/1134271.1134282","volume-title":"Link KDD\u2019 05: Proceedings of the. 3rd international workshop on Link discovery.","author":"J. Shetty","year":"2005","unstructured":"J. Shetty and J. Adibi, \u201cDiscovering important nodes through graph entropy the case of enron email database,\u201d in Link KDD\u2019 05: Proceedings of the. 3rd international workshop on Link discovery. New York, NY, USA: ACM, 2005, pp. 74\u201381."},{"issue":"1","key":"6_CR22","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1109\/MIS.2005.16","volume":"20","author":"S. Staab","year":"2005","unstructured":"S. Staab, P. Domingos, P. Mika, J. Golbeck, L. Ding, T. Finin, A. Joshi, A. Nowak, and R. R. Vallacher, \u201cSocial networks applied,\u201d IEEE Intelligent Systems, vol. 20, no. 1, pp. 80\u201393, 2005.","journal-title":"IEEE Intelligent Systems"},{"issue":"6825","key":"6_CR23","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1038\/35065725","volume":"410","author":"S. H. Strogatz","year":"2001","unstructured":"S. H. Strogatz, \u201cExploring complex networks,\u201d Nature, vol. 410, no. 6825, pp. 268\u2013276, March 2001.","journal-title":"Nature"},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"J. R. Tyler, D. M. Wilkinson, and B. A. Huberman, \u201cEmail as spectroscopy: automated discovery of community structure within organizations,\u201d pp. 81\u201396, 2003.","DOI":"10.1007\/978-94-017-0115-0_5"},{"key":"6_CR25","doi-asserted-by":"publisher","first-page":"1506","DOI":"10.1145\/1529282.1529618","volume-title":"SAC\u2019 09: Proceedings of the 2009 ACM symposium on Applied Computing","author":"X. Wan","year":"2009","unstructured":"X. Wan, E. Milios, N. Kalyaniwalla, and J. Janssen, \u201cLink-based event detection in email communication networks,\u201d in SAC\u2019 09: Proceedings of the 2009 ACM symposium on Applied Computing. New York, NY, USA: ACM, 2009, pp. 1506\u20131510."},{"key":"6_CR26","first-page":"563","volume-title":"ICDM\u2019 04: Proceedings of the Fourth IEEE International Conference on Data Mining","author":"H. Yu","year":"2004","unstructured":"H. Yu, D. Searsmith, X. Li, and J. Han, \u201cScalable construction of topic directory with nonparametric closed termset mining,\u201d in ICDM\u2019 04: Proceedings of the Fourth IEEE International Conference on Data Mining. Washington, DC, USA: IEEE Computer Society, 2004, pp. 563\u2013566."},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"M. J. Zaki and C.-.I. Hsiao, \u201cCharm: An efficient algorithm for closed itemset mining,\u201d in SDM, 2002.","DOI":"10.1137\/1.9781611972726.27"}],"container-title":["From Sociology to Computing in Social Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-7091-0294-7_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,3]],"date-time":"2023-06-03T00:14:26Z","timestamp":1685751266000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-7091-0294-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783709102930","9783709102947"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-7091-0294-7_6","relation":{},"subject":[],"published":{"date-parts":[[2010]]}}}