BOOK-CHAPTER

TGP: Mining Top-K Frequent Closed Graph Pattern without Minimum Support

Yuhua LiQuan LinRuixuan LiDongsheng Duan

Year: 2010 Lecture notes in computer science Pages: 537-548   Publisher: Springer Science+Business Media
Keywords:
Computer science Lexicographical order Serialization Graph Data mining Theoretical computer science Algorithm Programming language Mathematics Combinatorics

Metrics

10
Cited By
0.00
FWCI (Field Weighted Citation Impact)
18
Refs
0.11
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Data Mining Algorithms and Applications
Physical Sciences →  Computer Science →  Information Systems
Advanced Database Systems and Queries
Physical Sciences →  Computer Science →  Computer Networks and Communications
Algorithms and Data Compression
Physical Sciences →  Computer Science →  Artificial Intelligence

Related Documents

JOURNAL ARTICLE

Mining top−k frequent patterns without minimum support threshold

Abdus SalamM. Sikandar Hayat Khayal

Journal:   Knowledge and Information Systems Year: 2011 Vol: 30 (1)Pages: 57-86
JOURNAL ARTICLE

Top-k Closed Sequential Graph Pattern Mining

K. Vijay BhaskarR. B. V. SubramanyamK. Thammi ReddyS. Sumalatha

Journal:   International Journal of Information Engineering and Electronic Business Year: 2016 Vol: 8 (4)Pages: 1-9
JOURNAL ARTICLE

Mining top-k frequent-regular closed patterns

Komate AmphawanPhilippe Lenca

Journal:   Expert Systems with Applications Year: 2015 Vol: 42 (21)Pages: 7882-7894
© 2026 ScienceGate Book Chapters — All rights reserved.