A greedy clustering algorithm based on interval pattern concepts and the problem of optimal box positioning

DOI10.1155/2017/4323590zbMath1439.68020OpenAlexW2759397629MaRDI QIDQ670431

Vladimir M. Staroverov, Stepan A. Nersisyan, Vera V. Pankratieva, Vladimir E. Podol'skij

Publication date: 18 March 2019

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2017/4323590

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Uses Software

• Scikit

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Range searching with efficient hierarchical cuttings
• Enclosing weighted points with an almost-unit ball
• On a circle placement problem
• Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees
• The maximum box problem and its application to data analysis
• Cluster Analysis
• Two FCA-Based Methods for Mining Gene Expression Data
• On Approximating the Depth and Related Problems
• Multidimensional binary search trees used for associative searching
• An Algorithm for Finding Best Matches in Logarithmic Expected Time

This page was built for publication: A greedy clustering algorithm based on interval pattern concepts and the problem of optimal box positioning