An Apriori-based Algorithm for Mining - 大阪大学

← Back to document page

, ciencyhasbeencon \Graphstructure" eldofchemistry,CASEandMultiCASEsystemsha vebeenoftenusedtodiscovercharacteristics ubstructuresofchemicalcom-pounds[8],[9]. Thoughthesesystemscane ciently ndthesubstructures, [14].Thoughtheproposedalgorithmisverye cienttominefre-quentschemasfrommassiveda ta, ,thepropositionalclassi cationtechniques, , ,theregressiontreetechniques, ,M5,andtheinductivelogicprogramming(ILP) techniqueshavebeenap-pliedinthecarcinoge nesispredictionsofchemicalcompounds[10], [7].However,theseapproachescandiscoveron lylimitedtypesofcharacteristicsubstructu res,becausethegraphstructuresmustbepre-c haracterizedbysomespeci ,atechniquetominethefrequentsubstructure scharacterizingthecarcinogenesisofchemic alcompoundshasbeenproposedwithoutrequiri nganyconversionofsubstructurestospeci cfeaturesbyDehaspeetal.[3].Theyused??Cur rentlybeeinginTokyoResearchInstitute,IBM ,1623-14Shimotsuruma,Yam-atoshi,Kanagawa ,242-8502, , [11].

An Apriori-based Algorithm for Mining F requen t Substructures from Graph Data Akihiro Inokuchi??,T ak ashi W ashio and Hiroshi Moto da I.S.I.R., Osak

  Based, Mining, Algorithm, An apriori based algorithm for mining, Apriori, An apriori based algorithm for mining f requen t, Requen