±±¾©Ê¯ÓÍ»¯¹¤Ñ§Ôº2026ÄêÑо¿ÉúÕÐÉú½ÓÊÕµ÷¼Á¹«¸æ
²é¿´: 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.

» ²ÂÄãϲ»¶

ÒÑÔÄ   »Ø¸´´ËÂ¥   ¹Ø×¢TA ¸øTA·¢ÏûÏ¢ ËÍTAºì»¨ TAµÄ»ØÌû

befair

Ìú¸Ëľ³æ (ÕýʽдÊÖ)

¡¾´ð°¸¡¿Ó¦Öú»ØÌû

¡ï ¡ï ¡ï
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.
Befairorbeaware
2Â¥2013-11-07 22:28:17
ÒÑÔÄ   »Ø¸´´ËÂ¥   ¹Ø×¢TA ¸øTA·¢ÏûÏ¢ ËÍTAºì»¨ TAµÄ»ØÌû

phu_grassman

ÈÙÓþ°æÖ÷ (ÖªÃû×÷¼Ò)

¿ìÀÖµº¡¢²¼¼ªµºµºÖ÷

ÓÅÐã°æÖ÷

¡¾´ð°¸¡¿Ó¦Öú»ØÌû

¡ï ¡ï ¡ï ¡ï ¡ï ¡ï ¡ï ¡ï ¡ï ¡ï
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
ÒÑÔÄ   »Ø¸´´ËÂ¥   ¹Ø×¢TA ¸øTA·¢ÏûÏ¢ ËÍTAºì»¨ TAµÄ»ØÌû

stingdhk

Ìú¸Ëľ³æ (ÖøÃûдÊÖ)

¡¾´ð°¸¡¿Ó¦Öú»ØÌû

¸öÈËÈÏΪ£¬ÕªÒªÓ¦¸ÃÓùýȥʽ¡£ÒòΪ³ÂÊöµÄ¶¼ÊÇÒѾ­Íê³ÉµÄʵÑé¡£
4Â¥2013-11-08 10:26:35
ÒÑÔÄ   »Ø¸´´ËÂ¥   ¹Ø×¢TA ¸øTA·¢ÏûÏ¢ ËÍTAºì»¨ TAµÄ»ØÌû

¿×ÀÏÈý

Ìú¸Ëľ³æ (ÖøÃûдÊÖ)

¡¾´ð°¸¡¿Ó¦Öú»ØÌû

¡ï
lidongze(RXMCDM´ú·¢): ½ð±Ò+1, ¶àл²ÎÓ룡 2013-12-30 21:44:10
Â¥Ö÷¶ÔժҪд×÷ÉÐδÈëÃÅ
ժҪд×÷Òªµã£º±»¶¯Óï̬£¬¹ýÈ¥Íê³Éʱ£¬Ä¿µÄ--ÎÊÌâ--·½·¨--½áÂÛ
5Â¥2013-11-08 16:41:22
ÒÑÔÄ   »Ø¸´´ËÂ¥   ¹Ø×¢TA ¸øTA·¢ÏûÏ¢ ËÍTAºì»¨ TAµÄ»ØÌû

dengÉñÖ®´Ì¿Í

ľ³æ (СÓÐÃûÆø)

¡¾´ð°¸¡¿Ó¦Öú»ØÌû

¡ï
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
ÒÑÔÄ   »Ø¸´´ËÂ¥   ¹Ø×¢TA ¸øTA·¢ÏûÏ¢ ËÍTAºì»¨ TAµÄ»ØÌû
Ïà¹Ø°æ¿éÌø×ª ÎÒÒª¶©ÔÄÂ¥Ö÷ lidongze µÄÖ÷Ìâ¸üÐÂ
×î¾ßÈËÆøÈÈÌûÍÆ¼ö [²é¿´È«²¿] ×÷Õß »Ø/¿´ ×îºó·¢±í
[¿¼ÑÐ] 285Çóµ÷¼Á +7 AZMK 2026-04-04 9/450 2026-04-06 00:06 by ÓÀ×ÖºÅ
[¿¼ÑÐ] ÉúÎïÓëÒ½Ò©Çóµ÷¼Á +5 heguanhua 2026-04-05 6/300 2026-04-05 22:58 by Hdyxbekcb
[¿¼ÑÐ] Çóµ÷¼Á +7 ÕÅzic 2026-04-05 8/400 2026-04-05 22:57 by Hdyxbekcb
[¿¼ÑÐ] 22408 ×Ü·Ö320£¬Ò»ÆªÂÛÎĶþ×÷£¬Á½¸ö¹úÈý£¬Çóµ÷¼Á +3 Leomulufu 2026-04-04 5/250 2026-04-05 19:04 by chongya
[¿¼ÑÐ] ¹¤¿Æ08-»úеר˶-Çóµ÷¼Á +3 À×Å··ÉÌß 2026-04-02 3/150 2026-04-05 18:49 by À¶ÔÆË¼Óê
[¿¼ÑÐ] 358Çóµ÷¼Á +7 Çïgk 2026-04-04 7/350 2026-04-05 13:29 by huangmoli
[¿¼ÑÐ] µ÷¼Á +3 ºÃºÃ¶ÁÊé¡£ 2026-04-02 3/150 2026-04-05 13:02 by arrow8852
[¿¼ÑÐ] 070300»¯Ñ§Ñ§Ë¶311·ÖÇóµ÷¼Á +10 Áº¸»¹óÏÕÖÐÇó 2026-04-04 12/600 2026-04-05 09:37 by guoweigw
[¿¼ÑÐ] 292·Ö£¬²ÄÁÏÓ뻯¹¤£¬ÉêÇëµ÷¼Á +22 ³ÌÇçÖ® 2026-04-01 26/1300 2026-04-04 22:03 by hemengdong
[ÂÛÎÄͶ¸å] ÇóÎÄÏ× 5+3 ys879651$ 2026-04-02 3/150 2026-04-04 17:22 by bobvan
[¿¼ÑÐ] ÔõôɾÌû×Ó°¡ +3 ·ìêØ1000 2026-04-04 3/150 2026-04-04 14:20 by ÍÁľ˶ʿÕÐÉú
[¿¼ÑÐ] Ò»Ö¾Ô¸Äϲý´óѧ324Çóµ÷¼Á +9 hanamiko 2026-03-30 9/450 2026-04-04 11:04 by Öí»á·É
[¿¼ÑÐ] Ò»Ö¾Ô¸Éî´ó085601²ÄÁϹ¤³Ìרҵ£¨×¨Ë¶£©300·Ö¿ÉÒÔµ÷¼ÁÈ¥ÄÄ +8 10160315 2026-04-02 8/400 2026-04-03 09:36 by hypershenger
[¿¼ÑÐ] ÉúÎïѧ308·ÖÇóµ÷¼Á£¨Ò»Ö¾Ô¸»ª¶«Ê¦´ó£© +6 ÏàÐűػá¹ââÍòÕ 2026-03-31 7/350 2026-04-02 23:16 by JourneyLucky
[¿¼ÑÐ] ½»Í¨ÔËÊ俼ÊÔ264·ÖÇ󹤿Ƶ÷¼Á +4 jike777 2026-04-02 4/200 2026-04-02 21:53 by zllcz
[¿¼ÑÐ] 275ѧ˶081000·þ´Óµ÷¼Áµ½ÆäËûרҵ£¬±£²»×¡±¾×¨ÒµÁË +7 һֻССˮţ 2026-04-02 8/400 2026-04-02 14:23 by alice-2022
[¿¼ÑÐ] 379Çóµ÷¼Á +3 ?¿à¹Ï²»¿à 2026-04-01 3/150 2026-04-01 20:09 by ÄºÔÆÇ庮
[¿¼ÑÐ] ÉúÎïÓëÒ½Ò©¿¼Ñе÷¼Á +5 Ìúº©º©123425 2026-03-31 5/250 2026-04-01 18:01 by syh9288
[¿¼ÑÐ] ÍÁľ304Çóµ÷¼Á +5 ¶¥¼¶²Á²Á 2026-03-31 5/250 2026-04-01 08:15 by fdcxdystjk£¤
[¿¼ÑÐ] 340Çóµ÷¼Á +4 Ï£ÍûÈç´Ëi 2026-03-31 4/200 2026-03-31 16:40 by 690616278
ÐÅÏ¢Ìáʾ
ÇëÌî´¦ÀíÒâ¼û