Püskülcü, HalisGürel, Görkem03.04. Department of Computer Engineering03. Faculty of Engineering01. Izmir Institute of Technology2014-07-222014-07-222008https://hdl.handle.net/11147/3691Thesis (Master)--Izmir Institute of Technology, Computer Engineering, Izmir, 2008Includes bibliographical references (leaves: 59-63)Text in English; Abstract: Turkish and Englishx, 63 leavesFollowing the increasing use of XML technology for data storage and data exchange between applications, the subject of mining XML documents has become more researchable and important topic. In this study, we considered the problem of Mining Association Rules between items in XML document. The principal purpose of this study is applying association rule algorithms directly to the XML documents with using XQuery which is a functional expression language that can be used to query or process XML data. We used three different algorithms; Apriori, AprioriTid and High Efficient AprioriTid. We give comparisons of mining times of these three apriori-like algorithms on XML documents using different support levels, different datasets and different dataset sizes.eninfo:eu-repo/semantics/openAccessQA76.9.D343 G786 2008Data minningXML (Document marcup language)Computer algorithmsMaster Thesis