Title :
Implicit Groups of Web Pages as Constrained Top N Concepts
Author :
Li, A. ; Haraguchi, M. ; Okubo, Y.
Author_Institution :
Grad. Sch. of Infor. Sci. & Tech., Hokkaido Univ., Sapporo
Abstract :
This paper presents an effective depth-first mining algorithm for finding relatively smaller therefore more implicit groups of Web pages as formal concepts. The algorithm is based on a dynamic ordering method depending on each search node and some search tree expansion rules. Moreover it is designed so as to find top N implicit concepts subject to the size restriction and some space constraints reflecting userpsilas interests.
Keywords :
Internet; data mining; tree searching; Web page; constrained top N concept; depth-first mining algorithm; dynamic ordering method; implicit group; search tree expansion rule; Association rules; Bipartite graph; Clustering algorithms; Electronic mail; Engines; Intelligent agent; Itemsets; Portals; Search methods; Web pages; Cluster; Constrained Mining; Dynamic Ordering; Formal Concept; Implicit Groups;
Conference_Titel :
Web Intelligence and Intelligent Agent Technology, 2008. WI-IAT '08. IEEE/WIC/ACM International Conference on
Conference_Location :
Sydney, NSW
Print_ISBN :
978-0-7695-3496-1
DOI :
10.1109/WIIAT.2008.325
