Javascript must be enabled to continue!
Semi-supervised oblique predictive clustering trees
View through CrossRef
Semi-supervised learning combines supervised and unsupervised learning approaches to learn predictive models from both labeled and unlabeled data. It is most appropriate for problems where labeled examples are difficult to obtain but unlabeled examples are readily available (e.g., drug repurposing). Semi-supervised predictive clustering trees (SSL-PCTs) are a prominent method for semi-supervised learning that achieves good performance on various predictive modeling tasks, including structured output prediction tasks. The main issue, however, is that the learning time scales quadratically with the number of features. In contrast to axis-parallel trees, which only use individual features to split the data, oblique predictive clustering trees (SPYCTs) use linear combinations of features. This makes the splits more flexible and expressive and often leads to better predictive performance. With a carefully designed criterion function, we can use efficient optimization techniques to learn oblique splits. In this paper, we propose semi-supervised oblique predictive clustering trees (SSL-SPYCTs). We adjust the split learning to take unlabeled examples into account while remaining efficient. The main advantage over SSL-PCTs is that the proposed method scales linearly with the number of features. The experimental evaluation confirms the theoretical computational advantage and shows that SSL-SPYCTs often outperform SSL-PCTs and supervised PCTs both in single-tree setting and ensemble settings. We also show that SSL-SPYCTs are better at producing meaningful feature importance scores than supervised SPYCTs when the amount of labeled data is limited.
Title: Semi-supervised oblique predictive clustering trees
Description:
Semi-supervised learning combines supervised and unsupervised learning approaches to learn predictive models from both labeled and unlabeled data.
It is most appropriate for problems where labeled examples are difficult to obtain but unlabeled examples are readily available (e.
g.
, drug repurposing).
Semi-supervised predictive clustering trees (SSL-PCTs) are a prominent method for semi-supervised learning that achieves good performance on various predictive modeling tasks, including structured output prediction tasks.
The main issue, however, is that the learning time scales quadratically with the number of features.
In contrast to axis-parallel trees, which only use individual features to split the data, oblique predictive clustering trees (SPYCTs) use linear combinations of features.
This makes the splits more flexible and expressive and often leads to better predictive performance.
With a carefully designed criterion function, we can use efficient optimization techniques to learn oblique splits.
In this paper, we propose semi-supervised oblique predictive clustering trees (SSL-SPYCTs).
We adjust the split learning to take unlabeled examples into account while remaining efficient.
The main advantage over SSL-PCTs is that the proposed method scales linearly with the number of features.
The experimental evaluation confirms the theoretical computational advantage and shows that SSL-SPYCTs often outperform SSL-PCTs and supervised PCTs both in single-tree setting and ensemble settings.
We also show that SSL-SPYCTs are better at producing meaningful feature importance scores than supervised SPYCTs when the amount of labeled data is limited.
Related Results
ecision Farming and Predictive Analytics in Precision Farming and Predictive Analytics in Precision Farming and Predictive Analytics in Precision Farming and Predictive Analytics in Precision Farming and Predictive Analytics in Precision Farming and Predi
ecision Farming and Predictive Analytics in Precision Farming and Predictive Analytics in Precision Farming and Predictive Analytics in Precision Farming and Predictive Analytics in Precision Farming and Predictive Analytics in Precision Farming and Predi
The scope of sensor networks and the Internet of Things spanning rapidly to diversified domains but not limited to sports, health, and business trading. In recent past, the sensors...
CHOOSING SEEDS FOR SEMI-SUPERVISED GRAPH BASED CLUSTERING
CHOOSING SEEDS FOR SEMI-SUPERVISED GRAPH BASED CLUSTERING
Though clustering algorithms have long history, nowadays clustering topic still attracts a lot of attention because of the need of efficient data analysis tools in many application...
Novel Dual-Constraint-Based Semi-Supervised Deep Clustering Approach
Novel Dual-Constraint-Based Semi-Supervised Deep Clustering Approach
Semi-supervised clustering can be viewed as a clustering paradigm that exploits both labeled and unlabeled data to steer learning accurate data clusters and avoid local minimum sol...
Attitude motion of spacecraft during oblique solar panel deployment
Attitude motion of spacecraft during oblique solar panel deployment
PurposeThe purpose of this paper is to establish the dynamics model of spacecraft during deployment of oblique solar panel using Auto Dynamic Analysis of Mechanical System (ADAMS) ...
The Kernel Rough K-Means Algorithm
The Kernel Rough K-Means Algorithm
Background:
Clustering is one of the most important data mining methods. The k-means
(c-means ) and its derivative methods are the hotspot in the field of clustering research in re...
Soft Semi-Supervised Deep Learning-Based Clustering
Soft Semi-Supervised Deep Learning-Based Clustering
Semi-supervised clustering typically relies on both labeled and unlabeled data to guide the learning process towards the optimal data partition and to prevent falling into local mi...
GRAPH BASED CLUSTERING WITH CONSTRAINTS AND ACTIVE LEARNING
GRAPH BASED CLUSTERING WITH CONSTRAINTS AND ACTIVE LEARNING
During the past few years, semi-supervised clustering has emerged as a new interesting direction in machine learning research. In a semi-supervised clustering algorithm, the cluste...
Standard views do not suffice in assessing distal scaphoid articular cannulated screw penetration
Standard views do not suffice in assessing distal scaphoid articular cannulated screw penetration
Abstract
Background
Articular screw penetration is one of the most common hardware-related problems after scaphoid fracture fixation, occurring in u...

