期刊文献+

密度聚类算法在卵巢早衰古代方用药分析中的应用 被引量:1

The Application of Density-Based Clustering Algorithm in the Ancient Prescription's Medication Analysis for Premature Ovarian Failure
原文传递
导出
摘要 目的探寻密度聚类算法在卵巢早衰古代方用药分析中的应用情况,进而分析卵巢早衰古代方用药规律。方法采用基于密度聚类的optics算法。结果生成簇排序结果图,根据不同可达距离,输出两组结果类簇。结论运用optics算法,通过设置不同的可达距离阈值,可以有效得出古代方中部分相似药物间的协同与替换作用,或探寻出古方中某些非临床常用药物对现代卵巢早衰疾病的作用,为临床治疗提供新的思路及方法。 Objective To explore the concrete details about the application of density-based clustering algorithm in the ancient prescription’s medication analysis of premature ovarian failure and then to analyze the medication rule in ancient prescription’s medication analysis. Methods The optics algorithm based on density-based clustering algorithm. Results The outcomes are generated a cluster sorting graphic and output two sets of clusters which are according to the different reachable distance. Conclusion Based on the optics algorithm,this article has found the coordination and substitution of some similar medicine in the ancient prescription,the impact some non-clinical medicines can have on premature ovarian failure and the new idea and methods for clinical treatment by setting different thresholds of reach distance.
出处 《时珍国医国药》 CAS CSCD 北大核心 2017年第7期1789-1791,共3页 Lishizhen Medicine and Materia Medica Research
基金 江苏省中医药局基金项目(No.LZ13035) 江苏省自然科学基金-青年项目(No.BK20140958)
关键词 密度聚类 卵巢早衰 用药规律 Density-based clustering algorithm Premature ovarian failure Medication rules
  • 相关文献

参考文献2

二级参考文献14

  • 1http://www.ics.uci.edu/~ndeam/MLSununary.html.
  • 2TDT3 Multilanguage Text Corpus,Version 2.0;LDC Catalog Number LDC2001T58,isbn:158563-193-0.
  • 3MacQueen J.Some methods for classification and analysis of multivariate observations[C]//LeCam L M,Neymon J,eds.Prec of Fifth Berkeley Symposium on Math.Star and Prob:University of California Press,1967:281-297.
  • 4Tan P N,Steinbach M,等著.范明,范宏建,等译.数据挖掘导论(Introduction to Data Mining)[M].北京:人民邮电出版社,2006.
  • 5Ester M,Kriegel H P,Sander J.A density-based algorithm for discovering clusters in large spatial databases with noise[C]//Uzama M Fayyad,Padhraic Smyth,Gregory Piatetsky-Shapiro,eds.Proc of 2nd International Conference on Knowledge Discovery and Data Mining (KDD' 96).Portland:ACM Press,1996:226-231.
  • 6Ankerst M,Breunig M M,et al.OPTICS:ordering points to identify the clustering structure[C]//Alex Delis,Christos Falontsos,Shahram Ghandeharizadeh,eds.Prec ACM S1GMOD'99 lnt Conf on Management of Data.Philadelphia Pennsylvania:ACM Press,1999:49-60.
  • 7Agrawal R,C,ehrke J,GunopulosD,et al.Automatic subspace clustering of high dimensionaldata fordataminingapplications[C]//LanraHaas,Ashutosh Tiwary,eds.Prec of t998 ACM-SIGMOD Infl Conf on Management of Data.Seattle,Washington:ACM Press,1998:94-105.
  • 8Katzavounidis I,Kuo C,Zhang Z.A new initialization technique for generalized lloyd iteration[J].IEEE Signal Processing Letters,1994,1(10):144-146.
  • 9Tou J T,Ganzalez R C.Pattern recognition principles[M].Dyersburg,TIN,USA:Addison-Wesley,1975.
  • 10Christian Maueeri,Diem Ho.Clustering by kernel density[J].Computational Economics,2007,29(2):199-212.

共引文献17

同被引文献10

引证文献1

二级引证文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部