| ²é¿´: 1150 | »Ø¸´: 5 | ||
| ±¾Ìû²úÉú 1 ¸ö ·ÒëEPI £¬µã»÷ÕâÀï½øÐв鿴 | ||
lidongze½ð³æ (СÓÐÃûÆø)
|
[ÇóÖú]
ÕªÒª·Òë
|
|
|
ÕªÒª ±¾ÎÄÌÖÂÛ¶àάÊý¾Ý¶ÔÏóµÄÓÐÐò¾ÛÀàÎÊÌâ. ±¾ÎÄÈÚºÏÁËÑù±¾¼¸ºÎÂÖÀªÏàËÆ¶È£¨SGSD£©Ëã·¨ºÍk-¾ùÖµ¾ÛÀàËã·¨£¬¹¹Ôì³ö¡°SGSDÓÐÐò¾ÛÀàËã·¨¡±£¬¸ø³öÁËËã·¨µÄÒ»¸öʵ֤·ÖÎö£¬²¢Í¬²Î¿¼ÎÄÏ×ÖйØÓÚÓÃÀýÊý¾ÝµÄÆäËüËã·¨µÄ¾ÛÀà½á¹û½øÐÐÁ˱ȽÏ. ½á¹û±íÃ÷£º±¾ÎÄËã·¨½«¶àάÊý¾Ý¶ÔÏóÓ³ÉäΪһά½á¹¹Ê±ÐÅÏ¢·Ö±æÂʸߣ¬ÇÒ²»ÒÀÀµÊý¾Ý¼¯Ö®ÍâµÄÏÈÑé֪ʶºÍר¼Ò¾Ñ飬ʵ֤½áÂÛ·ûºÏʵ¼ÊÇé¿ö. ·ÒëµÄÓ¢Óï°ïæ¸Äһϰ¡ Abstract:This paper discusses the problems on the ordered clustering algorithm for multidimensional data objects. Combining the sample geometry similarity algorithm (SGSD) and the k-means clustering algorithm, the SGSD ordered clustering algorithm is proposed, and exampled. And compares with the results of other references which use the same datas. The conclusion shows that,when the algorithm maps the multidimensional data object for one dimensional,the information resolution is high. it does¡¯t depend on the datas set of prior knowledges and expert experiences which is outside the datas set ,the empirical conclusion of the algorithm conforms to the actual. |
» ²ÂÄãϲ»¶
081700£¬311£¬Çóµ÷¼Á
ÒѾÓÐ15È˻ظ´
Ò»Ö¾Ô¸±±¾©»¯¹¤085600 310·ÖÇóµ÷¼Á
ÒѾÓÐ18È˻ظ´
085600²ÄÁÏÓ뻯¹¤301·ÖÇóµ÷¼ÁԺУ
ÒѾÓÐ4È˻ظ´
²ÄÁÏÓ뻯¹¤371Çóµ÷¼Á
ÒѾÓÐ14È˻ظ´
336²ÄÁÏÓ뻯¹¤085600Çóµ÷¼Á
ÒѾÓÐ7È˻ظ´
²ÄÁÏ334Çóµ÷¼Á
ÒѾÓÐ18È˻ظ´
331Çóµ÷¼Á
ÒѾÓÐ8È˻ظ´
332Çóµ÷¼Á
ÒѾÓÐ17È˻ظ´
Ò»Ö¾Ô¸ÄϾ©º½¿Õº½Ìì´óѧ ²ÄÁÏÓ뻯¹¤329·ÖÇóµ÷¼Á
ÒѾÓÐ4È˻ظ´
²ÄÁÏר˶322
ÒѾÓÐ7È˻ظ´
befair
Ìú¸Ëľ³æ (ÕýʽдÊÖ)
- ·ÒëEPI: 112
- Ó¦Öú: 131 (¸ßÖÐÉú)
- ½ð±Ò: 12332.8
- ºì»¨: 20
- Ìû×Ó: 661
- ÔÚÏß: 608.6Сʱ
- ³æºÅ: 2651461
- ×¢²á: 2013-09-13
- ÐÔ±ð: GG
- רҵ: ºê¹Û¾¼Ã¹ÜÀíÓëÕ½ÂÔ
¡¾´ð°¸¡¿Ó¦Öú»ØÌû
¡ï ¡ï ¡ï
RXMCDM: 2013-12-30 21:45:29
lidongze(RXMCDM´ú·¢): ½ð±Ò+3, ¶àлӦÖú£¡ 2013-12-30 21:45:57
RXMCDM: 2013-12-30 21:45:29
lidongze(RXMCDM´ú·¢): ½ð±Ò+3, ¶àлӦÖú£¡ 2013-12-30 21:45:57
|
dz¼û£º Abstract:This paper discusses some topics related to the ordered clustering algorithm for multidimensional data objects. Integrating the sample geometry similarity algorithm (SGSD) and the k-means clustering algorithm, the SGSD ordered clustering algorithm is proposed and an example is given. Comparison is made with results in the references using other algorithms on the same data. The results show that, the resolution is high when using the newly proposed algorithm to map multidimensional data object onto one dimensional one. Moreover, the approach does not rely on any prior knowledge or expert experience than the data set itself and the the example shows a good agreement with the actual case. |

2Â¥2013-11-07 22:28:17
phu_grassman
ÈÙÓþ°æÖ÷ (ÖªÃû×÷¼Ò)
¿ìÀÖµº¡¢²¼¼ªµºµºÖ÷
- ·ÒëEPI: 265
- Ó¦Öú: 7 (Ó×¶ùÔ°)
- ¹ó±ö: 1.392
- ½ð±Ò: 7538.7
- É¢½ð: 11599
- ºì»¨: 107
- ɳ·¢: 11
- Ìû×Ó: 5611
- ÔÚÏß: 1480.2Сʱ
- ³æºÅ: 1151372
- ×¢²á: 2010-11-20
- רҵ: µç»¯Ñ§
- ¹ÜϽ: English Cafe
¡¾´ð°¸¡¿Ó¦Öú»ØÌû
¡ï ¡ï ¡ï ¡ï ¡ï ¡ï ¡ï ¡ï ¡ï ¡ï
lidongze(RXMCDM´ú·¢): ½ð±Ò+10, ×î¼Ñ´ð°¸£¡ 2013-12-30 21:45:14
RXMCDM: ·ÒëEPI+1 2013-12-30 21:45:20
lidongze(RXMCDM´ú·¢): ½ð±Ò+10, ×î¼Ñ´ð°¸£¡ 2013-12-30 21:45:14
RXMCDM: ·ÒëEPI+1 2013-12-30 21:45:20
| Abstract: Ordered clustering algorithm was discussed for multidimensional data objects in this paper. The SGSD ordered clustering algorithm was proposed based on the sample geometry similarity algorithm (SGSD) and the k-means clustering algorithm, and a practical analysis was performed. Besides, a comparison was made with the results of other algorithms from the references which use the same data. It shows that high information resolution can be achieved when the algorithm maps the multidimensional data object for one dimension, which is independent of any prior knowledge or expertise outside the data set. The empirical conclusion agrees with the actual conditions. |
3Â¥2013-11-07 22:42:22
stingdhk
Ìú¸Ëľ³æ (ÖøÃûдÊÖ)
- ·ÒëEPI: 10
- Ó¦Öú: 203 (´óѧÉú)
- ½ð±Ò: 9338.7
- É¢½ð: 186
- ºì»¨: 30
- ɳ·¢: 29
- Ìû×Ó: 2889
- ÔÚÏß: 533.1Сʱ
- ³æºÅ: 2153810
- ×¢²á: 2012-11-28
- ÐÔ±ð: MM
- רҵ: Ò©Îï·ÖÎö
4Â¥2013-11-08 10:26:35
¿×ÀÏÈý
Ìú¸Ëľ³æ (ÖøÃûдÊÖ)
- Ó¦Öú: 155 (¸ßÖÐÉú)
- ½ð±Ò: 9135.9
- É¢½ð: 4
- ºì»¨: 28
- Ìû×Ó: 2859
- ÔÚÏß: 1204.4Сʱ
- ³æºÅ: 939759
- ×¢²á: 2010-01-09
- רҵ: Ï𽺼°µ¯ÐÔÌå
5Â¥2013-11-08 16:41:22
dengÉñÖ®´Ì¿Í
ľ³æ (СÓÐÃûÆø)
- ·ÒëEPI: 12
- Ó¦Öú: 64 (³õÖÐÉú)
- ½ð±Ò: 2284.9
- ºì»¨: 3
- Ìû×Ó: 186
- ÔÚÏß: 123.8Сʱ
- ³æºÅ: 2747727
- ×¢²á: 2013-10-23
- ÐÔ±ð: GG
- רҵ: Ö²ÎïÉúÀíÓëÉú»¯
¡¾´ð°¸¡¿Ó¦Öú»ØÌû
¡ï
lidongze(RXMCDM´ú·¢): ½ð±Ò+1, ¶àлӦÖú£¡ 2013-12-30 21:41:58
lidongze(RXMCDM´ú·¢): ½ð±Ò+1, ¶àлӦÖú£¡ 2013-12-30 21:41:58
|
Abstract: The problems of the ordered clustering algorithm for multidimensional data objects was discussed in this article. The sample geometry similarity algorithm (SGSD) and the k-means clustering algorithm were fused in the study, the SGSD ordered clustering algorithm was built, a demonstration analysis of algorithm was given. Besides, it was compared to the results of other algorithms from the references which use the same data. The results showed that a high information resolution could be obtained when the algorithm maps the multidimensional data object for one dimension, and it wouldn't rely on priori knowledge and expert experience out of data sets, empirical conclusion conformed to the actual conditions. ×¾¼û |
6Â¥2013-11-08 20:39:53














»Ø¸´´ËÂ¥
5