Novel meta-heuristic algorithms for clustering web documents

DOI10.1016/j.amc.2007.12.058zbMath1154.68492MaRDI QIDQ945273

Morteza Haghir Chehreghani, Hassan Abolhassani, Rana Forsati, Mehrdad Mahdavi

Publication date: 12 September 2008

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2007.12.058

zbMATH Keywords

optimization; hybridization; \(K\)-means; harmony search; document clustering

Mathematics Subject Classification ID

68W05: Nonnumerical algorithms

68T05: Learning and adaptive systems in artificial intelligence

68M10: Network design and communication in computer systems

68T10: Pattern recognition, speech recognition

Related Items

An improved harmony search algorithm for synchronization of discrete-time chaotic systems, Chaotic harmony search algorithms

Uses Software

• AntClust
• KAON
• C4.5

Cites Work

• An improved harmony search algorithm for solving optimization problems
• An efficient constraint handling method for genetic algorithms
• Active semi-supervised fuzzy clustering
• Global-best harmony search
• A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice
• K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality
• Recent Studies in Automatic Text Analysis and Document Retrieval
• Empirical and theoretical comparisons of selected criterion functions for document clustering
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item