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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 03 Jg. 3; S. 190 - 194
Hauptverfasser: Li, A., Haraguchi, M., Okubo, Y.
Format: Tagungsbericht
Sprache:Englisch
Japanisch
Veröffentlicht: Washington, DC, USA IEEE Computer Society 01.12.2008
IEEE
Schriftenreihe:ACM Conferences
Schlagworte:
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
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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