{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:24:57Z","timestamp":1750307097190,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,9,3]],"date-time":"2012-09-03T00:00:00Z","timestamp":1346630400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,9,3]]},"DOI":"10.1145\/2381716.2381850","type":"proceedings-article","created":{"date-parts":[[2012,10,11]],"date-time":"2012-10-11T15:35:23Z","timestamp":1349969723000},"page":"701-706","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["A clustering approach for structural k-anonymity in social networks using genetic algorithm"],"prefix":"10.1145","author":[{"given":"Vikas Kumar","family":"Sihag","sequence":"first","affiliation":[{"name":"Motilal Nehru National Institute of Technology Allahabad, Allahabad, India"}]}],"member":"320","published-online":{"date-parts":[[2012,9,3]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"In Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques","author":"Aggarwal G.","year":"2004","unstructured":"G. Aggarwal , N. Mishra , and B. P. Mishra . Secure computation of the kth-ranked element . In In Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques , 2004 . G. Aggarwal, N. Mishra, and B. P. Mishra. Secure computation of the kth-ranked element. In In Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques, 2004."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335438"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242598"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065167.1065184"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01718-6_4"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.844059"},{"key":"e_1_3_2_1_7_1","volume-title":"Dagstuhl Seminar Proc.: Theory of Evolutionary Algorithms","author":"Cilibrasi R.","year":"2006","unstructured":"R. Cilibrasi and P. Vitanyi . A new quartet tree heuristic for hierarchical clustering . In Dagstuhl Seminar Proc.: Theory of Evolutionary Algorithms , 2006 . R. Cilibrasi and P. Vitanyi. A new quartet tree heuristic for hierarchical clustering. In Dagstuhl Seminar Proc.: Theory of Evolutionary Algorithms, 2006."},{"key":"e_1_3_2_1_8_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2009","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to Algorithms . MIT Press , 2009 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, 2009."},{"key":"e_1_3_2_1_9_1","first-page":"429","article-title":"Towards a methodology for statistical disclosure control","volume":"15","author":"Dalenius T.","year":"1977","unstructured":"T. Dalenius . Towards a methodology for statistical disclosure control . Statistik Tidskrift , 15 : 429 -- 444 , 1977 . T. Dalenius. Towards a methodology for statistical disclosure control. Statistik Tidskrift, 15:429--444, 1977.","journal-title":"Statistik Tidskrift"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/773153.773174"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/b101874"},{"key":"e_1_3_2_1_12_1","volume-title":"Genetic Algorithms in Search, Optimization and Machine Learning","author":"Goldberg D.","year":"1989","unstructured":"D. Goldberg . Genetic Algorithms in Search, Optimization and Machine Learning . Addison-Wesley , 1989 . D. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, 1989."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972795.67"},{"key":"e_1_3_2_1_14_1","first-page":"07","volume-title":"Anonymizing social networks","author":"Hay M.","year":"2007","unstructured":"M. Hay , G. Miklau , D. Jensen , P. Weis , and S. Srivastava . Anonymizing social networks . Computer Science Department Faculty Publication Series , pages 07 -- 19 , 2007 . M. Hay, G. Miklau, D. Jensen, P. Weis, and S. Srivastava. Anonymizing social networks. Computer Science Department Faculty Publication Series, pages 07--19, 2007."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453873"},{"key":"e_1_3_2_1_16_1","volume-title":"Adaptation in Natural and Articial Systems","author":"Holland J.","year":"1975","unstructured":"J. Holland . Adaptation in Natural and Articial Systems . University of Michigan Press , 1975 . J. Holland. Adaptation in Natural and Articial Systems. University of Michigan Press, 1975."},{"key":"e_1_3_2_1_17_1","volume-title":"Strategy and transaction in an African factory","author":"Kapferer B.","year":"1972","unstructured":"B. Kapferer . Strategy and transaction in an African factory . Manchester : Manchester University Press , 1972 . B. Kapferer. Strategy and transaction in an African factory. Manchester: Manchester University Press, 1972."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.220.4598.671"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(02)00036-3"},{"issue":"3","key":"e_1_3_2_1_20_1","first-page":"219","article-title":"Two algorithms for constructing a delaunay triangulation","volume":"9","author":"Lee D. T.","year":"1980","unstructured":"D. T. Lee and B. J. Schachter . Two algorithms for constructing a delaunay triangulation . International Journal of Parallel Programming , 9 ( 3 ): 219 -- 242 , 1980 . D. T. Lee and B. J. Schachter. Two algorithms for constructing a delaunay triangulation. International Journal of Parallel Programming, 9(3):219--242, 1980.","journal-title":"International Journal of Parallel Programming"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376629"},{"key":"e_1_3_2_1_22_1","volume-title":"Direct factor analysis of sociometric data","author":"MacRae J.","year":"1960","unstructured":"J. MacRae . Direct factor analysis of sociometric data . 1960 . J. MacRae. Direct factor analysis of sociometric data. 1960."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1055558.1055591"},{"key":"e_1_3_2_1_24_1","volume-title":"the mathworks inc","author":"Moler C.","year":"1980","unstructured":"C. Moler . Matlab user's guide , the mathworks inc . 1980 . C. Moler. Matlab user's guide, the mathworks inc. 1980."},{"key":"e_1_3_2_1_25_1","volume-title":"Introduction to Genetic Algorithms","author":"Sivanandam S. N.","year":"2008","unstructured":"S. N. Sivanandam and S. N. Deepa . Introduction to Genetic Algorithms . Springer , 2008 . S. N. Sivanandam and S. N. Deepa. Introduction to Genetic Algorithms. Springer, 2008."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.294849"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218488502001648"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1739041.1739058"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972788.67"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972795.83"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01307-2_6"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/1793474.1793485"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497459"}],"event":{"name":"CUBE '12: CUBE International IT Conference & Exhibition","sponsor":["CUOT Curtin University of Technology"],"location":"Pune India","acronym":"CUBE '12"},"container-title":["Proceedings of the CUBE International Information Technology Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2381716.2381850","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2381716.2381850","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:34:46Z","timestamp":1750239286000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2381716.2381850"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,3]]},"references-count":33,"alternative-id":["10.1145\/2381716.2381850","10.1145\/2381716"],"URL":"https:\/\/doi.org\/10.1145\/2381716.2381850","relation":{},"subject":[],"published":{"date-parts":[[2012,9,3]]},"assertion":[{"value":"2012-09-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}