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

Full description

Saved in:

Bibliographic Details
Published in:	Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 03 Vol. 3; pp. 190 - 194
Main Authors:	Li, A., Haraguchi, M., Okubo, Y.
Format:	Conference Proceeding
Language:	English Japanese
Published:	Washington, DC, USA IEEE Computer Society 01.12.2008 IEEE
Series:	ACM Conferences
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!