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!
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 user’s interests.
AbstractList 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.
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.
Author Li, A.
Haraguchi, M.
Okubo, Y.
Author_xml – sequence: 1
  givenname: A.
  surname: Li
  fullname: Li, A.
– sequence: 2
  givenname: M.
  surname: Haraguchi
  fullname: Haraguchi, M.
– sequence: 3
  givenname: Y.
  surname: Okubo
  fullname: Okubo, Y.
BookMark eNqNkD9PwzAUxC0BElC6srB4Y0p5dvwnZqsqKJEqYCjqaL3ELyjQxlEcBr49LeUDMJ10dzrpfpfstIsdMXYtYCYEuLtNWc7XMwlQzHKpT9jU2QKscTpXzohzNk3pAwCEkKC0umD35a7ftnU78uUQv_rEY8M3VPFXfKfEMfFF7NI4YNtR4OvY8-eDU1M_pit21uA20fRPJ-zt8WG9eMpWL8tyMV9lKLUeM4FFCIEqo5wQFlApY42SqBwoCmCFk0Y0CFTZgEUlXUBVYE1g0ej9h3zCbo67LRH5fmh3OHx7ZRVYXezT22OK9c5XMX4mL8AfWPhfFv7Awh93sv81fTW01OQ_Gbdfig
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/WIIAT.2008.325
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList

Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EndPage 194
ExternalDocumentID 4740758
Genre orig-research
GroupedDBID 6IE
6IF
6IK
6IL
6IN
AAJGR
AARBI
ACM
ADPZR
ALMA_UNASSIGNED_HOLDINGS
APO
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
GUFHI
IERZE
OCL
RIB
RIC
RIE
RIL
AAWTH
LHSKQ
ID FETCH-LOGICAL-a255t-1a8dddeb6491170a4467642a4904ed0719261fa0eb7da8b29da48ace07a653253
IEDL.DBID RIE
ISBN 9780769534961
0769534961
IngestDate Wed Aug 27 02:16:29 EDT 2025
Wed Jan 31 06:47:57 EST 2024
IsPeerReviewed false
IsScholarly false
Keywords Cluster
Implicit Groups
Dynamic Ordering
Formal Concept
Constrained Mining
Language English
Japanese
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a255t-1a8dddeb6491170a4467642a4904ed0719261fa0eb7da8b29da48ace07a653253
PageCount 5
ParticipantIDs acm_books_10_1109_WIIAT_2008_325_brief
ieee_primary_4740758
acm_books_10_1109_WIIAT_2008_325
PublicationCentury 2000
PublicationDate 2008-12-01
PublicationDateYYYYMMDD 2008-12-01
PublicationDate_xml – month: 12
  year: 2008
  text: 2008-12-01
  day: 01
PublicationDecade 2000
PublicationPlace Washington, DC, USA
PublicationPlace_xml – name: Washington, DC, USA
PublicationSeriesTitle ACM Conferences
PublicationTitle Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 03
PublicationTitleAbbrev WIIATW
PublicationYear 2008
Publisher IEEE Computer Society
IEEE
Publisher_xml – name: IEEE Computer Society
– name: IEEE
SSID ssj0001120454
Score 1.4280521
Snippet This paper presents an effective depth-first mining algorithm for finding relatively smaller therefore more implicit groups of Web pages as formal concepts....
SourceID ieee
acm
SourceType Publisher
StartPage 190
SubjectTerms 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
Title Implicit Groups of Web Pages as Constrained Top N Concepts
URI https://ieeexplore.ieee.org/document/4740758
Volume 3
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NS8NAEB3a4sFT1VasX-xBPBmbpJvsrjcRiwUpPVTaW9iPCfRgU5rU3-_uJlYEQbwlSwjhbTKbN_tmHsCNZCrPVagCrqQlKBHXNg4iCzBkGCU6V7H2M_3KplO-XIpZC-72tTCI6MVneO8O_V6-KfTOpcqGlFn6kfA2tBljda3Wdz4lco3Vac3MReL6oEdNg539edO0MQrFcDGZPM5rKeXI2WS3pX7_YbDi15dx939PdgT970I9MtsvQcfQwvUJdL-cGkjz4fbgYeKF46uK-FxTSYqcLFCRmY0mJZElcb6d3i0CDZkXGzJ1I07xUvbhbfw8f3oJGteEQFp6UAWR5MbGLJVS4VxlpOV7zJIMSUVI0dg_CmFJUy5DVMxIrmJhJOVS28mRaWKxGJ1CZ12s8QxIjizVsdOJpkhHsRYYKx5rlImRWoV0AMTCljk6UGaeTYQi88jW7pb2bgO4_euSTG1XmA-g52DNNnWTjaxB9Pz34Qs49MINryu5hE613eEVHOiPalVur_2b8QmAEbJJ
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NS8NAEB3aKuipaivWzz2IJ2OTdPOx3kQsDdbQQ6S9hd3NBHqwLU3q73d3E1sEQbwlSwjhbTKbN_tmHsAtD0SeC1tYoeCKoDihVHEQAwvtAB1P5sKVZqbHQRyHsxmbNOB-WwuDiEZ8hg_60OzlZ0u50amyPg0U_fDCJux5lLpOVa21y6g4urU6rbg583QndKdusbM9r9s2OjbrT6PoKanElANtlN3k8uOHxYpZYYbt_z3bEXR3pXpksl2EjqGBixNof3s1kPrT7cBjZKTj85KYbFNBljmZoiATFU8KwguinTuNXwRmJFmuSKxHtOal6ML78CV5Hlm1b4LFFUEoLYeHmYpawqdM-8pwxfgCRTM4ZTbFTP1TMEWbcm6jCDIeCpdlnIZcqunhvqewGJxCa7Fc4BmQHANfulop6iMduJKhK0JXIvcyLoVNe0AUbKkmBEVq-ITNUoNs5W-p7taDu78uScV6jnkPOhrWdFW12UhrRM9_H76Bg1HyNk7HUfx6AYdGxmFUJpfQKtcbvIJ9-VnOi_W1eUu-APsctZA
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+of+the+2008+IEEE%2FWIC%2FACM+International+Conference+on+Web+Intelligence+and+Intelligent+Agent+Technology.+Volume+1&rft.atitle=Implicit+Groups+of+Web+Pages+as+Constrained+Top+N+Concepts&rft.au=Li%2C+A.&rft.au=Haraguchi%2C+M.&rft.au=Okubo%2C+Y.&rft.date=2008-12-01&rft.pub=IEEE&rft.isbn=9780769534961&rft.volume=3&rft.spage=190&rft.epage=194&rft_id=info:doi/10.1109%2FWIIAT.2008.325&rft.externalDocID=4740758
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780769534961/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780769534961/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780769534961/sc.gif&client=summon&freeimage=true