参考文献/References:
[ 1] Guillaume D, M urtagh F. C lustering of XML documents[ J] . Computer Phy sics Comm un ications, 2000, 127( 2 /3): 215-227.
[ 2] Doucet A, Ahonen-M ykaH. Na ve C lustering o f a Larg e XML Document Co llection[ C] / / Proc 1st Annua lWo rkshop o f the In itiativ e for the Eva luation of XML retrieval( INEX) . Germ any: ACM Press, 2002: 81-88.
[ 3] N ierm an A, Jagad ish H V. Ev aluating structura l sim ilarity in XML docum ents [ C ] / / Proceed ings of the 5th Inte rnational Workshop on theW eb and Database(W ebDB). M adison, 2002: 61-66.
[ 4] Zhang K, Shasha D. S imp le fast algor ithm s for the editing distance be tw een trees and related problem s[ J]. SIAM Journa l on Com puting, 1989, 18( 6): 1245-1 262.
[ 5] W ang L, Cheung D W, M am oulis N, et a.l An E ffic ient and Scalab leA lgor ithm for C luster ing XML Docum ents by Structure[ J]. IEEE TKDE, 2004, 16( 1): 82-96.
[ 6] LeungH P, Chung F L, Chan S C F. On the use o f h iera rchical info rma tion in sequentialm in ing-based XML document similarity compu tation[ J]. Know ledg e and Inform a tion System s, 2005, 7( 4): 476-498.
[ 7] LeungH P, Chung F L, Chan S C F, et a.l XML do cum ent c luste ring using comm on Xpath[ C] / / 2005 Internationa lWo rkshop on Challeng es inW eb Inform ation Retrieva l and Integ ration. Tokyo: IEEE Com puter Soc iety Press, 2005: 91-96.
[ 8] Nayak R, Xu S. XCLS: a fast and e ffective c lustering a lgor ithm fo r he terogenous XML do cum ents[ C] / / Proceeding of the 10 th Pac ific-Asia Conference on Know ledg e Discovery and Da taM ining. S ingapore: ACM Press, 2006.
[ 9] ChehredhaniM H, RahgozarM, Lucas C, et a.l C lustering roo ted ordered trees[ C ] / / Com puta tiona l Inte lligence and Data M in ing. H ono lulu, H aw ai:i IEEE Press, 2007: 450-455.
[ 10] Francesca F D, Gordano G, O rta le R, et a.l A genera l fram ework fo r XML do cum ent c luster ing [ R ]. Consig lio Nazionale de lle R icerche Istituto di Ca lco lo e Reti ad A lte Prestazion ,i 2003.
[ 11] Guha S, Rastog iR, Sh im K. ROCK: A robust cluster ing a lgo rithm for categor ica l attr ibutes[ C] / / Proceed ing s o f ICDE99.Sydney: IEEE Com puter So ciety Press, 1999.
[ 12] Yang Y, Guan X, You J. CLOPE: a fast and effec tive cluster ing algor ithm fo r transac tion data[ C] / / Proceed ings of the 8 th ACM SIGKDD In ternational Confe rence on Know ledge D iscovery and DataM in ing. Edm onton: ACM Press, 2002.
[ 13] Zak iM J. E fficientlym in ing frequent trees in a forest: a lgor ithm s and app lication[ J] . IEEE Transaction on Know ledge and
Data Eng inee ring: Spec ia l Issue onM ining B io log ica l Data, 2005, 17( 8): 1 021-1 035.
[ 14] Dalam agas T, Cheng T, W inkel K J, et a.l C luster ing XML do cum ents using structura l summ ar ies[ C ] / / Proceed ings of the EDBT W orkshop on C luster ing Info rm ation ove r theW eb. H e ide lberg: Spr inger Berlin, 2004: 547-556.
[ 15] Ch iY, X ia Y, Yang Y, e t a .l M in ing c losed and m ax im a l frequent subtrees from databases o f labe led roo ted trees[ J] . IEEE Transac tions on Know ledge and Data Eng ineering, 2005, 17: 190-202.