Research and application on Web information retrieval based on improved FP-growth algorithm

DOI10.1007/BF02829211MaRDI QIDQ3445975zbMATH OpenOpenAlexFDO

Authors Minghai Jiao, Ping Yan, Huiyan Jiang

Publication date 8 June 2007

Published in Wuhan University Journal of Natural Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02829211

zbMATH Keywords

clusteringhill-climbing algorithmclustering result evaluatingdensity unit

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10)

Recommendations

• An improved FP-growth algorithm based on aggregative chains
• New frequent pattern tree structure
• Improved FP-growth algorithm and its applications in the business association
• Fast FP-growth for association rule mining
• An improved algorithm of Apriori

Cites work

• scientific article; zbMATH DE number 1850010 (Why is no real title available?)
• Data mining. Concepts and techniques

Cited in

(2)

• A Web bibliographies retrieval structure based on the longest sequential frequent phrases
• An improved FP-growth algorithm based on aggregative chains

This page was built for publication: Research and application on Web information retrieval based on improved FP-growth algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3445975)