Special Issue's Articles

统计学习研究与应用专刊前言 高阳,陈松灿 2013,24(11):2473-2475 [Abstract(4765)]  [View PDF(6891)328.25 K]

Research Progress of Probabilistic Graphical Models：A Survey ZHANG Hong-Yi,WANG Li-Wei and CHEN Yu-Xi 2013,24(11):2476-2497 [Abstract(10758)]  [View PDF(38710)1.14 M]

Survey of Solving the Optimization Problems for Sparse Learning TAO Qing,GAO Qian-Kun,JIANG Ji-Yuan and CHU De-Jun 2013,24(11):2498-2507 [Abstract(6914)]  [View PDF(14727)784.43 K]

Study on Relational Classification Learning Bound WANG Xing,FANG Bin-Xing,ZHANG Hong-Li,HE Hui and ZHAO Lei 2013,24(11):2508-2521 [Abstract(6971)]  [View PDF(7301)1.53 M]

Lp Norm Constraint Multi-Kernel Learning Method for Semi-Supervised Support Vector Machine HU Qing-Hui,DING Li-Xin and HE Jin-Rong 2013,24(11):2522-2534 [Abstract(6144)]  [View PDF(8072)1.01 M]

Dynamical Granular Support Vector Regression Machine GUO Hu-Sheng and WANG Wen-Jian 2013,24(11):2535-2547 [Abstract(5801)]  [View PDF(6721)877.51 K]

Weighted Smooth CHKS Twin Support Vector Machines DING Shi-Fei,HUANG Hua-Juan and SHI Zhong-Zhi 2013,24(11):2548-2557 [Abstract(6192)]  [View PDF(7573)683.91 K]

Analyzing Cross-Core Performance Interference on Multi-Core Processors Based on Statistical Learning ZHAO Jia-Cheng,CUI Hui-Min and FENG Xiao-Bing 2013,24(11):2558-2570 [Abstract(6065)]  [View PDF(7790)899.08 K]

Clustering-Based PU Active Text Classification Method LIU Lu,PENG Tao,ZUO Wan-Li and DAI Yao-Kang 2013,24(11):2571-2583 [Abstract(6794)]  [View PDF(9353)882.95 K]

Fisher Consistent Cost Sensitive Boosting Algorithm CAO Ying,MIAO Qi-Guang,LIU Jia-Chen and GAO Lin 2013,24(11):2584-2596 [Abstract(6388)]  [View PDF(8013)3.19 M]

Pairwise Costs in Subclass Discriminant Analysis WAN Jian-Wu and YANG Ming 2013,24(11):2597-2609 [Abstract(5804)]  [View PDF(6821)1.32 M]

Soft Subspace Clustering Algorithm for Streaming Data ZHU Lin,LEI Jing-Sheng,BI Zhong-Qin and YANG Jie 2013,24(11):2610-2627 [Abstract(6038)]  [View PDF(7703)2.18 M]

Non-Mode Clustering of Categorical Data with Attributes Weighting CHEN Li-Fei and GUO Gong-De 2013,24(11):2628-2641 [Abstract(6023)]  [View PDF(7637)865.16 K]

Distance Metric Learning Based on Side Information Autogeneration for Time Series ZOU Peng-Cheng,WANG Jian-Dong,YANG Guo-Qing,ZHANG Xia and WANG Li-Na 2013,24(11):2642-2655 [Abstract(6027)]  [View PDF(8968)949.14 K]

Isospectral Manifold Learning Algorithm HUANG Yun-Juan and LI Fan-Zhang 2013,24(11):2656-2666 [Abstract(5598)]  [View PDF(7778)790.46 K]

Shaping Reward Learning Approach from Passive Samples QIAN Yu,YU Yang and ZHOU Zhi-Hua 2013,24(11):2667-2675 [Abstract(6012)]  [View PDF(8448)1.10 M]

Parametric Approximation Policy Iteration Algorithm Based on Gaussian Process FU Qi-Ming,LIU Quan,FU Yu-Chen,ZHOU Yi-Cheng and YU Jun 2013,24(11):2676-2686 [Abstract(6418)]  [View PDF(7171)974.78 K]

Cuckoo Search Algorithm with Dimension by Dimension Improvement WANG Li-Jin,YIN Yi-Long and ZHONG Yi-Wen 2013,24(11):2687-2698 [Abstract(7583)]  [View PDF(11941)477.62 K]

Fast Algorithm on Stochastic Block Model for Exploring General Communities CHAI Bian-Fang,YU Jian,JIA Cai-Yan and WANG Jing-Hong 2013,24(11):2699-2709 [Abstract(6590)]  [View PDF(11129)723.40 K]

Robust Transition Estimation for Community Evolution and Evolutionary Outlier Detection HU Yun,WANG Chong-Jun,XIE Jun-Yuan,WU Jun and ZHOU Zuo-Jian 2013,24(11):2710-2720 [Abstract(6291)]  [View PDF(7050)1.35 M]

Recommendations Based on Collaborative Filtering by Exploiting Sequential Behaviors SUN Guang-Fu,WU Le,LIU Qi,ZHU Chen and CHEN En-Hong 2013,24(11):2721-2733 [Abstract(10080)]  [View PDF(11707)1.01 M]

Undirected Graph Model for Expert Evidence Document Recognition MAO Cun-Li,YU Zheng-Tao,WU Ze-Jian,GUO Jian-Yi and XIAN Yan-Tuan 2013,24(11):2734-2746 [Abstract(5663)]  [View PDF(7243)871.78 K]

Face Detection Based on Local Region Sparse Coding ZHANG Shu,CAI Yong and XIE Mei 2013,24(11):2747-2757 [Abstract(5697)]  [View PDF(8605)1.69 M]

Aurora Image Classification Based on LDA Combining with Saliency Information HAN Bing,YANG Chen and GAO Xin-Bo 2013,24(11):2758-2766 [Abstract(6981)]  [View PDF(7902)1.20 M]