| ²é¿´: 407 | »Ø¸´: 2 | |||
| ±¾Ìû²úÉú 1 ¸ö LS-EPI £¬µã»÷ÕâÀï½øÐв鿴 | |||
baroshiľ³æ (ÕýʽдÊÖ)
|
[ÇóÖú]
°ïæ²éһƪÎÄÕµÄSCIºÅ£¬Ð»Ð»¡£
|
||
|
A compressed sensing approach for efficient ensemble learning [ ·¢×ÔÊÖ»ú°æ http://muchong.com/3g ] |
» ²ÂÄãϲ»¶
²ÄÁÏÓ뻯¹¤328·Öµ÷¼Á
ÒѾÓÐ3È˻ظ´
279·ÖÇóµ÷¼Á Ò»Ö¾Ô¸211
ÒѾÓÐ20È˻ظ´
293Çóµ÷¼Á
ÒѾÓÐ3È˻ظ´
Ò»Ö¾Ô¸»ª¶«Àí¹¤´óѧ081700£¬³õÊÔ·ÖÊý271
ÒѾÓÐ6È˻ظ´
085404µç×ÓÐÅÏ¢284·ÖÇóµ÷¼Á
ÒѾÓÐ3È˻ظ´
306Çó0703µ÷¼ÁÒ»Ö¾Ô¸»ªÖÐʦ·¶
ÒѾÓÐ9È˻ظ´
Ò»Ö¾Ô¸¼ª´ó»¯Ñ§322Çóµ÷¼Á
ÒѾÓÐ6È˻ظ´
Çóµ÷¼Á
ÒѾÓÐ5È˻ظ´
344Çóµ÷¼Á
ÒѾÓÐ3È˻ظ´
Ò»Ö¾Ô¸¹þ¹¤´ó£¬085400£¬320£¬Çóµ÷¼Á
ÒѾÓÐ3È˻ظ´

muse
¾èÖú¹ó±ö (ÖªÃû×÷¼Ò)
- LS-EPI: 147
- Ó¦Öú: 314 (´óѧÉú)
- ¹ó±ö: 0.549
- ½ð±Ò: 20674
- É¢½ð: 2783
- ºì»¨: 81
- ɳ·¢: 156
- Ìû×Ó: 6098
- ÔÚÏß: 1468.2Сʱ
- ³æºÅ: 1207111
- ×¢²á: 2011-02-19
- רҵ: ±£ÏÕѧ
¡¾´ð°¸¡¿Ó¦Öú»ØÌû
¡ï ¡ï ¡ï ¡ï ¡ï
¸Ðл²ÎÓ룬ӦÖúÖ¸Êý +1
baroshi: ½ð±Ò+5, ¡ï¡ï¡ï¡ï¡ï×î¼Ñ´ð°¸ 2014-09-21 19:06:41
sunshan4379: LS-EPI+1, ¸ÐлӦÖú£¡ 2014-09-21 19:36:07
¸Ðл²ÎÓ룬ӦÖúÖ¸Êý +1
baroshi: ½ð±Ò+5, ¡ï¡ï¡ï¡ï¡ï×î¼Ñ´ð°¸ 2014-09-21 19:06:41
sunshan4379: LS-EPI+1, ¸ÐлӦÖú£¡ 2014-09-21 19:36:07
|
A compressed sensing approach for efficient ensemble learning ×÷Õß:Li, L (Li, Lin)[ 1 ] ; Stolkin, R (Stolkin, Rustam)[ 2 ] ; Jiao, LC (Jiao, Licheng)[ 1 ] ; Liu, F (Liu, Fang)[ 1 ] ; Wang, S (Wang, Shuang)[ 1 ] PATTERN RECOGNITION ¾í: 47 ÆÚ: 10 Ò³: 3451-3465 DOI: 10.1016/j.patcog.2014.04.015 ³ö°æÄê: OCT 2014 ²é¿´ÆÚ¿¯ÐÅÏ¢ ÕªÒª This paper presents a method for improved ensemble learning, by treating the optimization of an ensemble of classifiers as a compressed sensing problem. Ensemble learning methods improve the performance of a learned predictor by integrating a weighted combination of multiple predictive models. Ideally, the number of models needed in the ensemble should be minimized, while optimizing the weights associated with each included model. We solve this problem by treating it as an example of the compressed sensing problem, in which a sparse solution must be reconstructed from an under-determined linear system. Compressed sensing techniques are then employed to find an ensemble which is both small and effective. An additional contribution of this paper, is to present a new performance evaluation method (a new pairwise diversity measurement) called the roulette-wheel kappa-error. This method takes into account the different weightings of the classifiers, and also reduces the total number of pairs of classifiers needed in the kappa-error diagram, by selecting pairs through a roulette-wheel selection method according to the weightings of the classifiers. This approach can greatly improve the clarity and informativeness of the kappa-error diagram, especially when the number of classifiers in the ensemble is large. We use 25 different public data sets to evaluate and compare the performance of compressed sensing ensembles using four different sparse reconstruction algorithms, combined with two different classifier learning algorithms and two different training data manipulation techniques. We also give the comparison experiments of our method against another five state-of-the-art pruning methods. These experiments show that our method produces comparable or better accuracy, while being significantly faster than the compared methods. (C) 2014 Elsevier Ltd. All rights reserved. ¹Ø¼ü´Ê ×÷Õ߹ؼü´Ê:Ensemble learning; Classification; Classifier ensemble; Sparse reconstruction; Compressed sensing; Roulette-wheel selection; Kappa-error KeyWords Plus:RANDOM SUBSPACE METHOD; CLASSIFIER ENSEMBLES; NEURAL-NETWORKS; ALGORITHMS; REGRESSION; DIVERSITY ×÷ÕßÐÅÏ¢ ͨѶ×÷ÕßµØÖ·: Li, L (ͨѶ×÷Õß) [ÏÔʾÔöÇ¿×éÖ¯ÐÅÏ¢µÄÃû³Æ] Xidian Univ, Int Res Ctr Intelligent Percept & Computat, Minist Educ, Key Lab Intelligent Percept & Image Understanding, Xian 710071, Peoples R China. µØÖ·: [ÏÔʾÔöÇ¿×éÖ¯ÐÅÏ¢µÄÃû³Æ] [ 1 ] Xidian Univ, Int Res Ctr Intelligent Percept & Computat, Minist Educ, Key Lab Intelligent Percept & Image Understanding, Xian 710071, Peoples R China [ÏÔʾÔöÇ¿×éÖ¯ÐÅÏ¢µÄÃû³Æ] [ 2 ] Univ Birmingham, Sch Mech Engn, Birmingham B15 2TT, W Midlands, England µç×ÓÓʼþµØÖ·:xdlinli86@163.com; lchjiao@mail.xidian.edu.cn »ù½ð×ÊÖúÖÂл »ù½ð×ÊÖú»ú¹¹ ÊÚȨºÅ National Natural Science Foundation of China 61371201 61001202 61272279 61273317 National Top Youth Talents Support Program of China ²é¿´»ù½ð×ÊÖúÐÅÏ¢ ³ö°æÉÌ ELSEVIER SCI LTD, THE BOULEVARD, LANGFORD LANE, KIDLINGTON, OXFORD OX5 1GB, OXON, ENGLAND Àà±ð / ·ÖÀà Ñо¿·½Ïò:Computer Science; Engineering Web of Science Àà±ð:Computer Science, Artificial Intelligence; Engineering, Electrical & Electronic ÎÄÏ×ÐÅÏ¢ ÎÄÏ×ÀàÐÍ:Article ÓïÖÖ:English Èë²ØºÅ: WOS:000338392400020 ISSN: 0031-3203 µç×Ó ISSN: 1873-5142 ÆÚ¿¯ÐÅÏ¢ Ŀ¼£º Current Contents Connect® Impact Factor (Ó°ÏìÒò×Ó): Journal Citation Reports® ÆäËûÐÅÏ¢ IDS ºÅ: AK4KA Web of Science ºËÐĺϼ¯ÖÐµÄ "ÒýÓõIJο¼ÎÄÏ×": 47 Web of Science ºËÐĺϼ¯ÖÐµÄ "±»ÒýƵ´Î": 0 |

2Â¥2014-09-21 18:42:43
muse
¾èÖú¹ó±ö (ÖªÃû×÷¼Ò)
- LS-EPI: 147
- Ó¦Öú: 314 (´óѧÉú)
- ¹ó±ö: 0.549
- ½ð±Ò: 20674
- É¢½ð: 2783
- ºì»¨: 81
- ɳ·¢: 156
- Ìû×Ó: 6098
- ÔÚÏß: 1468.2Сʱ
- ³æºÅ: 1207111
- ×¢²á: 2011-02-19
- רҵ: ±£ÏÕѧ

3Â¥2014-09-21 18:42:51













»Ø¸´´ËÂ¥
40