| ²é¿´: 443 | »Ø¸´: 3 | |||
| ±¾Ìû²úÉú 1 ¸ö LS-EPI £¬µã»÷ÕâÀï½øÐв鿴 | |||
baroshiľ³æ (ÕýʽдÊÖ)
|
[ÇóÖú]
°ïæ²éһƪÎÄÕµÄSCIºÅ£¬Ð»Ð»¡£
|
||
|
Selective multiple kernel learning for classification with ensemble strategy [ ·¢×ÔÊÖ»ú°æ http://muchong.com/3g ] |
» ²ÂÄãϲ»¶
285Çóµ÷¼Á
ÒѾÓÐ6È˻ظ´
085701»·¾³¹¤³ÌÇóµ÷¼Á
ÒѾÓÐ6È˻ظ´
291Çóµ÷¼Á
ÒѾÓÐ6È˻ظ´
315·ÖÇóµ÷¼Á
ÒѾÓÐ6È˻ظ´
277¹òÇóµ÷¼Á
ÒѾÓÐ8È˻ظ´
295Çóµ÷¼Á
ÒѾÓÐ5È˻ظ´
295²ÄÁϹ¤³Ìר˶Çóµ÷¼Á
ÒѾÓÐ3È˻ظ´
083000ѧ˶274Çóµ÷¼Á
ÒѾÓÐ4È˻ظ´
275Çóµ÷¼Á
ÒѾÓÐ8È˻ظ´
Ò»Ö¾Ô¸211ԺУ 344·Ö ¶«±±Å©Òµ´óѧÉúÎïѧѧ˶£¬Çóµ÷¼Á
ÒѾÓÐ8È˻ظ´

muse
¾èÖú¹ó±ö (ÖªÃû×÷¼Ò)
- LS-EPI: 147
- Ó¦Öú: 314 (´óѧÉú)
- ¹ó±ö: 0.549
- ½ð±Ò: 20674
- É¢½ð: 2783
- ºì»¨: 81
- ɳ·¢: 156
- Ìû×Ó: 6098
- ÔÚÏß: 1468.2Сʱ
- ³æºÅ: 1207111
- ×¢²á: 2011-02-19
- רҵ: ±£ÏÕѧ
¡¾´ð°¸¡¿Ó¦Öú»ØÌû
¸Ðл²ÎÓ룬ӦÖúÖ¸Êý +1
|
Selective multiple kernel learning for classification with ensemble strategy ×÷Õß:Tao Sun; Licheng Jiao; Fang Liu; Shuang Wang; Jie Feng Pattern Recognition ¾í: 46 ÆÚ: 11 Ò³: 3081-90 DOI: 10.1016/j.patcog.2013.04.003 ³ö°æÄê: Nov. 2013 ÕªÒª Multiple Kernel Learning (MKL) aims to seek a better result than single kernel learning by combining a compact set of sub-kernels. However, MKL with L1-norm easily discards the sub-kernels with complementary information and MKL with Lp-norm(pges2) often gets the redundant solution. To address these problems, a Selective Multiple Kernel Learning (SMKL) method, inspired by Ensemble Learning (EL), is proposed. Comparing MKL with Lp-norm(pges2), SMKL obtains a sparse solution by a pre-selection procedure. Comparing MKL with L1-norm, SMKL preserves the sub-kernels with complementary information by guaranteeing the high discrimination and large diversity of pre-selected sub-kernels. For quantifying the discrimination and diversity of sub-kernels, a new kernel evaluation is designed. SMKL reduces the scale of MKL optimization and saves the memory storing of the sub-kernels, which extends the scale of problem that MKL could solve. Specially, a fast SMKL method using Linfinity-norm constraint is focused, which needs no MKL optimization process. It means that the memory is hardly a limitation for MKL with the large scale problem. Experiments state that our method is effective for classification. [All rights reserved Elsevier]. ×÷ÕßÐÅÏ¢ ×÷ÕßµØÖ·: Tao Sun; Licheng Jiao; Shuang Wang; Jie Feng; Key Lab. of Intell. Perception & Image Understanding of Minist. of Educ. of China, Xidian Univ., Xi'an, China. Fang Liu; Sch. of Comput. Sci. & Technol., Xidian Univ., Xi'an, China. ³ö°æÉÌ Elsevier Science Ltd., UK Àà±ð / ·ÖÀà Ñо¿·½Ïò:Computer Science; Mathematics (ÓÉ Thomson Reuters Ìṩ) ·ÖÀà´úÂë:C1230L Learning in AI; C1180 Optimisation techniques CODEN TNRA8ÊÜ¿ØË÷Òý:learning (artificial intelligence); optimisation; pattern classification ·ÇÊÜ¿ØË÷Òý:selective multiple kernel learning; ensemble strategy classificatio; single kernel learning; ensemble learning; EL; preselection procedure; Linfinity-norm constraint; SMKL method; MKL optimization process ÎÄÏ×ÐÅÏ¢ ÎÄÏ×ÀàÐÍ:Journal Paper ÓïÖÖ:English Èë²ØºÅ:13704917 ISSN:0031-3203 ²Î¿¼ÎÄÏ×Êý:32 ÆÚ¿¯ÐÅÏ¢ Impact Factor (Ó°ÏìÒò×Ó): Journal Citation Reports® ÆäËûÐÅÏ¢ ´¦ÀíÀàÐÍ:Theoretical or Mathematical ÎÄÏ׺Å:S0031-3203(13)00173-8 |

2Â¥2014-09-21 18:50:40
muse
¾èÖú¹ó±ö (ÖªÃû×÷¼Ò)
- LS-EPI: 147
- Ó¦Öú: 314 (´óѧÉú)
- ¹ó±ö: 0.549
- ½ð±Ò: 20674
- É¢½ð: 2783
- ºì»¨: 81
- ɳ·¢: 156
- Ìû×Ó: 6098
- ÔÚÏß: 1468.2Сʱ
- ³æºÅ: 1207111
- ×¢²á: 2011-02-19
- רҵ: ±£ÏÕѧ
¡¾´ð°¸¡¿Ó¦Öú»ØÌû
¡ï ¡ï ¡ï ¡ï ¡ï
baroshi: ½ð±Ò+5, ¡ï¡ï¡ï¡ï¡ï×î¼Ñ´ð°¸ 2014-09-21 18:56:25
sunshan4379: LS-EPI+1, ¸ÐлӦÖú£¡ 2014-09-21 19:36:28
baroshi: ½ð±Ò+5, ¡ï¡ï¡ï¡ï¡ï×î¼Ñ´ð°¸ 2014-09-21 18:56:25
sunshan4379: LS-EPI+1, ¸ÐлӦÖú£¡ 2014-09-21 19:36:28
|
Selective multiple kernel learning for classification with ensemble strategy ×÷Õß:Sun, T (Sun, Tao)[ 1 ] ; Jiao, LC (Jiao, Licheng)[ 1 ] ; Liu, F (Liu, Fang)[ 2 ] ; Wang, S (Wang, Shuang)[ 1 ] ; Feng, J (Feng, Jie)[ 1 ] PATTERN RECOGNITION ¾í: 46 ÆÚ: 11 Ò³: 3081-3090 DOI: 10.1016/j.patcog.2013.04.003 ³ö°æÄê: NOV 2013 ²é¿´ÆÚ¿¯ÐÅÏ¢ ÕªÒª Multiple Kernel Learning (MKL) aims to seek a better result than single kernel learning by combining a compact set of sub-kernels. However, MKL. with L1-norm easily discards the sub-kernels with complementary information and MKL with Lp-norm(p >= 2) often gets the redundant solution. To address these problems, a Selective Multiple Kernel Learning (SMKL) method, inspired by Ensemble Learning (EL), is proposed. Comparing MKL with Lp-norm(p >= 2), SMKL obtains a sparse solution by a pre-selection procedure. Comparing MKL with Lp-norm, SMKL preserves the sub-kernels with complementary information by guaranteeing the high discrimination and large diversity of pre-selected sub-kernels. For quantifying the discrimination and diversity of sub-kernels, a new kernel evaluation is designed. SMKL reduces the scale of MKL optimization and saves the memory storing of the sub-kernels, which extends the scale of problem that MKL could solve. Specially, a fast SMKL method using L infinity-norm constraint is focused, which needs no MIC optimization process. It means that the memory is hardly a limitation for MKL with the large scale problem. Experiments state that our method is effective for classification. (C) 2013 Elsevier Ltd. All rights reserved. ¹Ø¼ü´Ê ×÷Õ߹ؼü´Ê:Ensemble learning; Kernel evaluation; Multiple kernel learning; Selective multiple kernel learning; Fast selective multiple kernel learning KeyWords Plus IMENSIONALITY REDUCTION×÷ÕßÐÅÏ¢ ͨѶ×÷ÕßµØÖ·: Feng, J (ͨѶ×÷Õß) [ÏÔʾÔöÇ¿×éÖ¯ÐÅÏ¢µÄÃû³Æ] Xidian Univ, Minist Educ China, Key Lab Intelligent Percept & Image Understanding, Xian 710071, Peoples R China. µØÖ·: [ÏÔʾÔöÇ¿×éÖ¯ÐÅÏ¢µÄÃû³Æ] [ 1 ] Xidian Univ, Minist Educ China, Key Lab Intelligent Percept & Image Understanding, Xian 710071, Peoples R China [ÏÔʾÔöÇ¿×éÖ¯ÐÅÏ¢µÄÃû³Æ] [ 2 ] Xidian Univ, Sch Comp Sci & Technol, Xian 710071, Peoples R China µç×ÓÓʼþµØÖ·:taosun@mail.xidian.edu.cn; lchjiao@mail.xidian.edu.cn; f63liu@163.com; shwang@mail.xidian.edu.cn; jiefeng0109@163.com »ù½ð×ÊÖúÖÂл »ù½ð×ÊÖú»ú¹¹ ÊÚȨºÅ National Basic Research Program (973 Program) of China 2013CB329402 National Natural Science Foundation of China 61173092 61072106 61003198 Program for New Century Excellent Talents in University NCET-11-0692 Fundamental Research Funds for the Central Universities K50510020001 K50513100012 ²é¿´»ù½ð×ÊÖúÐÅÏ¢ ³ö°æÉÌ 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:000321232900017 ISSN: 0031-3203 ÆÚ¿¯ÐÅÏ¢ Ŀ¼£º Current Contents Connect® Impact Factor (Ó°ÏìÒò×Ó): Journal Citation Reports® ÆäËûÐÅÏ¢ IDS ºÅ: 175LT Web of Science ºËÐĺϼ¯ÖÐµÄ "ÒýÓõIJο¼ÎÄÏ×": 32 Web of Science ºËÐĺϼ¯ÖÐµÄ "±»ÒýƵ´Î": 2 |

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

4Â¥2014-09-21 18:51:13














»Ø¸´´ËÂ¥
TNRA8
IMENSIONALITY REDUCTION