K-tree, NMF and INEX 2008

Today I gave a presentation within my research group at QUT. It discusses the submissions I made for the XML Mining track at INEX 2008. This required classifying documents based on previously known examples (classification). Another task required grouping similar documents together with no prior information other than the documents themselves (clustering). I also looked at different ways to measure cluster quality using negentropy and document link graphs. The K-tree algorithm is part of my research. This is the first time it was applied to document clustering. The results for the entire track should be out soon. I will also be giving the presentation at the QLD IEEE Computational Intelligence Symposium.