A review and experimental comparison of multivariate decision trees

L Cañete-Sifuentes, R Monroy… - IEEE Access, 2021 - ieeexplore.ieee.org
Decision trees are popular as stand-alone classifiers or as base learners in ensemble
classifiers. Mostly, this is due to decision trees having the advantage of being easy to …

Interactive visual cluster analysis by contrastive dimensionality reduction

J Xia, L Huang, W Lin, X Zhao, J Wu… - … on Visualization and …, 2022 - ieeexplore.ieee.org
We propose a contrastive dimensionality reduction approach (CDR) for interactive visual
cluster analysis. Although dimensionality reduction of high-dimensional data is widely used …

A stochastic quasi-Newton method for large-scale nonconvex optimization with applications

H Chen, HC Wu, SC Chan… - IEEE transactions on …, 2019 - ieeexplore.ieee.org
Ensuring the positive definiteness and avoiding ill conditioning of the Hessian update in the
stochastic Broyden-Fletcher-Goldfarb-Shanno (BFGS) method are significant in solving …

Unsupervised fuzzy model-based Gaussian clustering

MS Yang, SJ Chang-Chien, Y Nataliani - Information Sciences, 2019 - Elsevier
Abstract In 1993, Banfield and Raftery first proposed model-based Gaussian (MB-Gauss)
clustering, using eigenvalue decomposition of Gaussian covariance matrix to detect different …

m-arcsinh: An Efficient and Reliable Function for SVM and MLP in scikit-learn

L Parisi - arXiv preprint arXiv:2009.07530, 2020 - arxiv.org
This paper describes the'm-arcsinh', a modified ('m-') version of the inverse hyperbolic sine
function ('arcsinh'). Kernel and activation functions enable Machine Learning (ML)-based …

An efficient approach to kNN algorithm for IoT devices

B Gawri, A Kasturi, LBM Neti… - 2022 14th International …, 2022 - ieeexplore.ieee.org
K nearest neighbor is a popular method for classification, but it suffers from high runtime and
space complexity. Various advancements have been made to improve classification …

Gaussian-kernel c-means clustering algorithms

SJ Chang-Chien, Y Nataliani, MS Yang - Soft Computing, 2021 - Springer
Partitional clustering is the most used in cluster analysis. In partitional clustering, hard c-
means (HCM)(or called k-means) and fuzzy c-means (FCM) are the most known clustering …

Visual cluster separation using high-dimensional sharpened dimensionality reduction

Y Kim, AC Telea, SC Trager… - Information …, 2022 - journals.sagepub.com
Applying dimensionality reduction (DR) to large, high-dimensional data sets can be
challenging when distinguishing the underlying high-dimensional data clusters in a 2D …

FT4cip: A new functional tree for classification in class imbalance problems

L Canete-Sifuentes, R Monroy… - Knowledge-Based …, 2022 - Elsevier
Decision trees (DTs) are popular classifiers partly due to their reasonably good classification
performance, their ease of interpretation, and their widespread use in ensembles. To …

Fault-Tolerant indoor localization based on speed conscious recurrent neural network using Kullback–Leibler divergence

PS Varma, V Anand - Peer-to-peer networking and applications, 2022 - Springer
IoT services are the basic building blocks of smart cities, and some of such crucial services
are provided by smart buildings. Most of the services like smart meters, indoor navigation …