通过对比图形学习进行无监督的歧视性特征选择.
概括
本研究引入了一种新的无监督特征选择方法,使用对比图形学习来改进数据分析. 它通过保留类特定属性和学习数据结构,有效地选择歧视性特征.
科学领域:
- 机器学习 机器学习
- 数据科学数据科学数据科学
- 计算机视觉 计算机视觉
背景情况:
- 无监督的特征选择对于分析未标记的数据至关重要.
- 现有的图形引导方法与特定类属性和编码歧视性信息作斗争.
- 当前的方法往往无法捕捉数据的内在集群结构.
研究的目的:
- 开发一种新的不受监督的歧视性特征选择方法.
- 解决现有方法在描述数据结构和类特定特征方面的局限性.
- 将特征选择和图形学习整合到一个统一的框架中.
主要方法:
- 通过对比图形学习提出了一种新的无监督的歧视性特征选择.
- 适应性学习了一个亲和矩阵来描述内在和集群结构.
- 在投影矩阵上使用l1,2-规范规范化,以保持类特定的特征.
主要成果:
- 拟议的模型有效地保留了类特定的特征,同时删除了多余的特征.
- 选择的特征很好地描述了数据的歧视性结构.
- 在实验中实现了最先进的性能.
结论:
- 新的框架成功地集成了特征选择和图形学习.
- 该方法增强了对未标记数据的歧视性信息的编码.
- 与现有的无监督特征选择技术相比,证明了卓越的性能.
相关概念视频
Quantifying and Rejecting Outliers: The Grubbs Test
1.6K
Sometimes, a data set can have a recorded numerical observation that greatly deviates from the rest of the data. Assuming that the data is normally distributed, a statistical method called the Grubbs test can be used to determine whether the observation is truly an outlier. To perform a two-tailed Grubbs test, first, calculate the absolute difference between the outlier and the mean. Then, calculate the ratio between this difference and the standard deviation of the sample. This...
1.6K
Vector Algebra: Graphical Method
12.2K
Vectors can be multiplied by scalars, added to other vectors, or subtracted from other vectors. The vector sum of two (or more) vectors is called the resultant vector or, for short, the resultant.
We use the laws of geometry to construct resultant vectors, followed by trigonometry to find vector magnitudes and directions. For a geometric construction of the sum of two vectors in a plane, we follow the parallelogram rule. Suppose two vectors are at arbitrary positions. Translate either one of...
We use the laws of geometry to construct resultant vectors, followed by trigonometry to find vector magnitudes and directions. For a geometric construction of the sum of two vectors in a plane, we follow the parallelogram rule. Suppose two vectors are at arbitrary positions. Translate either one of...
12.2K
Multiple Bar Graph
5.2K
As the name suggests, a multiple bar graph is the same as a bar graph but has multiple bars to depict relationships between different data values. One can include as many parameters as possible. However, each parameter must have the same unit of measurement.
Each bar or column in the multiple bar graph represents a data value. These graphs are used primarily in interrelating two or more sets of data. The categories of different kinds of data are listed along the horizontal or x-axis, whereas...
Each bar or column in the multiple bar graph represents a data value. These graphs are used primarily in interrelating two or more sets of data. The categories of different kinds of data are listed along the horizontal or x-axis, whereas...
5.2K
Difference from Background: Limit of Detection
6.4K
The limit of detection (LOD) is the smallest amount of analyte that can be distinguished from the background noise. The LOD value corresponds to the concentration at which the analyte signal is three times larger than the standard deviation of the blank signal. Below this value, the analyte signal cannot be differentiated from the background noise. It is calculated by dividing the calibration slope by 3 times the standard deviation of the blank signals.
The LOD indicates the presence or absence...
The LOD indicates the presence or absence...
6.4K
Classification of Signals
466
In signal processing, signals are classified based on various characteristics: continuous-time versus discrete-time, periodic versus aperiodic, analog versus digital, and causal versus noncausal. Each category highlights distinct properties crucial for understanding and manipulating signals.
A continuous-time signal holds a value at every instant in time, representing information seamlessly. In contrast, a discrete-time signal holds values only at specific moments, often denoted as x(n), where...
A continuous-time signal holds a value at every instant in time, representing information seamlessly. In contrast, a discrete-time signal holds values only at specific moments, often denoted as x(n), where...
466
Ogive Graph
5.6K
An ogive graph is sometimes called a cumulative frequency polygon. It is one type of frequency polygon that shows cumulative frequency. In other words, the cumulative percentages are added to the graph from left to right. An ogive graph plots cumulative frequency on the vertical y-axis and class boundaries along the horizontal x-axis. It’s very similar to a histogram; only instead of rectangles, an ogive displays a single point where the top right of the rectangle would be. Creating this...
5.6K


