Searching for an Optimal Partition of Incomplete Data with Application in Modeling Energy Efficiency of Public Buildings
From MaRDI portal
Publication:5145063
DOI10.17535/crorr.2018.0020zbMath1457.90134OpenAlexW2903591026WikidataQ128744692 ScholiaQ128744692MaRDI QIDQ5145063
Adela Has, Rudolf Scitovski, Marijana Zekić-Sušac
Publication date: 19 January 2021
Published in: Croatian Operational Research Review (Search for Journal in Brave)
Full work available at URL: https://hrcak.srce.hr/ojs/index.php/crorr/article/view/7529
Uses Software
Cites Work
- A fast algorithm for robust constrained clustering
- A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function
- An approach to cluster separability in a partition
- A toolbox for \(K\)-centroids cluster analysis
- Trimmed \(k\)-means: An attempt to robustify quantizers
- A new global optimization method for a symmetric Lipschitz continuous function and the application to searching for a globally optimal partition of a one-dimensional set
- One-dimensional center-based l 1-clustering method
- Cluster analysis in retail segmentation for credit scoring
- Data Clustering: Theory, Algorithms, and Applications
- THE BEST LEAST ABSOLUTE DEVIATIONS LINE – PROPERTIES AND TWO EFFICIENT METHODS FOR ITS DERIVATION
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
