Implicit Groups of Web Pages as Constrained Top N Concepts

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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 03 Ročník 3; s. 190 - 194
Hlavní autoři: Li, A., Haraguchi, M., Okubo, Y.
Médium: Konferenční příspěvek
Jazyk:angličtina
japonština
Vydáno: Washington, DC, USA IEEE Computer Society 01.12.2008
IEEE
Edice:ACM Conferences
Témata:
Association rules
Bipartite graph
Cluster
Clustering algorithms
Constrained Mining
Dynamic Ordering
Electronic mail
Engines
Formal Concept
Implicit Groups
Information systems > Information retrieval
Information systems > Information systems applications > Data mining
Intelligent agent
Itemsets
Portals
Search methods
Theory of computation > Logic > Constraint and logic programming
Web pages
Cluster
Implicit Groups
Dynamic Ordering
Formal Concept
Constrained Mining
ISBN:9780769534961, 0769534961
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 user’s interests.
ISBN:9780769534961
0769534961
DOI:10.1109/WIIAT.2008.325