SCIE, Ei, Scopus, DBLP, CSCD, etc.
Citation: | Xue Wang, Xuan Zhou, Shan Wang. Summarizing Large-Scale Database Schema Using Community Detection[J]. Journal of Computer Science and Technology, 2012, 27(3): 515-526. DOI: 10.1007/s11390-012-1240-1 |
[1] |
Newman M E J, Girvan M. Finding and evaluating commu-nity structure in networks. Physical Review E, 2004, 69(2):026113.
|
[2] |
Newman M E J, Fast algorithm for detecting communitystructure in networks. Physical Review E, 2004, 69(6):066133.
|
[3] |
Papadopoulos S, Kompatsiaris Y, Vakali A, Spyridonos P.Community detection in social media. Data Mining andKnowledge Discovery, 2012, 24(3): 515-554.
|
[4] |
Shi J, Malik . Normalized cuts and image segmentation.IEEE Transactions on Pattern Analysis and Machine Intel-ligence, 2000, 22(8): 888-905.
|
[5] |
Luxburg U. A tutorial on spectral clustering. Statistics andComputing, 2007, 17(4): 395-416.
|
[6] |
Rahn E, Bernstein P A. A survey of approaches to automaticschema matching. J. Very Large Data Base, 2001, 10(4):334-350.
|
[7] |
Yang X, Procopiuc C M, Srivastava D. Summarizing rela-tional databases. PVLDB, 2009, 2(1): 634-645.
|
[8] |
www.freebase.com, September 2011.
|
[9] |
Wu W, Reinwald B, Sismannis Y, Manjrekar B. Discoveringtopical structures of databases. In Proc. SIGMOD2008, June2008, pp.1019-1030.
|
[10] |
Dyer M E, Fireze A M. A simple heuristic for the p-centerproblem. Operations Research Letters, 1985, 3(6): 285-288.
|
[11] |
Clauset A, Newman M E J, Moore C. Finding communitystructure in very large networks. Physical Review E, 2004,70(6): 066111.
|
[12] |
Lancichinetti A, Fortunato S. Community detection algo-rithms: A comparative analysis. Physical Review E, 2009,80(5): 056117.
|
[13] |
Campbell L J, Halpin T A, Proper H A. Conceptual schemaswith abstractions making flat conceptual schemas more com-prehensible. Data & Knowledge Engineering, 1996, 20(1):39-85.
|
[14] |
Feldman P, Miller D. Entity model clustering: Structuringa data model by abstraction. The Computer Journal, 1986,29(4): 348-360.
|
[15] |
Teorey T, Wei G, Bolton D, Koenig J. ER model cluster-ing as an aid for user communication and documentation indatabase design. Communications of the ACM, 1989, 32(8):975-987.
|
[16] |
Huffman S B, Zoeller R V. A rule-based system tool for au-tomated ER model clustering. In Proc. the 8th InternationalConference on Entity-Relationship Approach to Database De-sign and Querying, Oct. 1990, pp.221-236.
|
[17] |
Campbell L J, Halpin T A, Proper H A. CA ERwin datamodeler, www.ca.com.
|
[18] |
Yu C, Jagadish H V. Schema summarization. In Proc. the32nd International Conference on Very Large Data Bases,Sep. 2006, pp.319-330.
|
[19] |
Motwani R, Raghavan P. Randomized Algorithms. Cam-bridge Univ. Press, 1995.
|
[20] |
Han J, Kamber M. Data Mining: Concepts and Techniques(2nd edition). Morgan Kaufmann, 2006.
|
[21] |
Domingos P, Richardson M. Mining the network value of cus-tomers. In Proc. the 7th ACM SIGKDD, Aug. 2001, pp.57-66.
|
[22] |
Richardson M, Domingos P. Mining knowledge-sharing sitesfor viral marketing. In Proc. the 8th ACM SIGKDD, July2002, pp.61-70.
|
[23] |
Kempe D, Kleinberg J M, Tardos E. Maximizing the spreadof in?uence through a social network. In Proc. the 9th ACMSIGKDD, Aug. 2003, pp.137-146.
|