• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Wen Guihua. Relative Transformation for Machine Learning[J]. Journal of Computer Research and Development, 2008, 45(4): 612-618.
Citation: Wen Guihua. Relative Transformation for Machine Learning[J]. Journal of Computer Research and Development, 2008, 45(4): 612-618.

Relative Transformation for Machine Learning

More Information
  • Published Date: April 14, 2008
  • Recently developed machine learning approaches such as manifold learning and the support vector machine learning work well on the clean data sets even if these data sets are highly folded, twisted, or curved. However, they are much sensitive to noises or outliers contained in the data set, as these noises or outliers easily distort the real topological structure of the underlying data manifold. To solve the problem, the relative transformation on the original data space is proposed by modeling the cognitive relative laws. It is proved that the relative transformation is a kind of nonlinear enlarging transformation so that it makes the transformed data more distinguishable. Meanwhile, the relative transformation can weaken the influence of noise on data and make data relative denser. To measure the similarity and distance between data points in relative space is more consistent with the intuition of people, which can be then applied to improve the machine learning approach. The relative transformation is simple, general and easy to implement. It also has clear physical meaning and does not add any parameter. The theoretical analysis and conducted experiments validate the proposed approach.
  • Related Articles

    [1]LiuPeixia, JiangHaitao, ZhuDaming. Complexity and Algorithm for Minimum Breakpoint Median from PQ-trees[J]. Journal of Computer Research and Development, 2016, 53(3): 644-650. DOI: 10.7544/issn1000-1239.2016.20148258
    [2]Xu Yuming, Zhu Ningbo, Ouyang Aijia, and Li Kenli. A Double-Helix Structure Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems[J]. Journal of Computer Research and Development, 2014, 51(6): 1240-1252.
    [3]Li Kenli, Luo Xing, Wu Fan, Zhou Xu, and Huang Xin. An Algorithm in Tile Assembly Model for Maximum Clique Problem[J]. Journal of Computer Research and Development, 2013, 50(3): 666-675.
    [4]Zhou Xu, Li Kenli, Yue Guangxue, Yang Zhibang. A Volume Molecular Solution for the Maximum Matching Problem on DNA-Based Computing[J]. Journal of Computer Research and Development, 2011, 48(11): 2147-2154.
    [5]Wang Bin, Guo Qing, Li Zhongbo, Yang Xiaochun. Index Structures for Supporting Block Edit Distance[J]. Journal of Computer Research and Development, 2010, 47(1): 191-199.
    [6]Li Kenli, Liu Jie, Yang Lei, Liu Wenbin. An O(1.414\+n) Volume Molecular Solutions for the Exact Cover Problem on DNA-Based Supercomputing[J]. Journal of Computer Research and Development, 2008, 45(10): 1782-1788.
    [7]Jiang He, Zhang Xianchao, Che Haoyang, Chen Guoliang. A Multi-Commodity Flow Linear Programming with Polynomial Constraints for Black and White Traveling Salesman Problem[J]. Journal of Computer Research and Development, 2007, 44(10): 1796-1800.
    [8]Li Kenli, Yao Fengjuan, Li Renfa, Xu Jin. Improved Molecular Solutions for the Knapsack Problem on DNA-Based Supercomputing[J]. Journal of Computer Research and Development, 2007, 44(6): 1063-1070.
    [9]Zhao Baohua, Guo Xionghui, QianLan, and Qu Yugui. On the Problem of How to Place the Observers in Passive Testing[J]. Journal of Computer Research and Development, 2005, 42(10): 1815-1819.
    [10]Zhou Huaqi, Lu Mingming, and Zhu Hong. A Preemptive Scheduling Problem with Different Interrupted Time Cost on Identical Parallel Machines[J]. Journal of Computer Research and Development, 2005, 42(3).

Catalog

    Article views (944) PDF downloads (608) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return