期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

离散格的一种启发式搜索算法 被引量：2

Heuristic algorithm for discretization lattice searching
下载PDF
导出
摘要 通过定义离散化方案之间的偏序关系以及交、并运算 ,将各种离散化方案组织成离散格。提出一种搜索离散格的启发式算法 ,实验表明该算法得到的一致决策表的断点数比已有解更少。 All discretization schemes are organized into a lattice named discretization lattice after partial order relation, then the meet and join operations between discretization schemes are defined. A heuristic algorithm is presented to search discretization lattice. The simulating experiments illustrate that this algorithm can find a consistent decision information table with less cut points than two solutions in references.
作者 王立宏 吴彦 吴耿锋
机构地区 烟台大学计算机科学与技术学院 青岛大学数学系 上海大学计算机工程与技术学院
出处 《计算机应用》 CSCD 北大核心 2004年第8期41-43,共3页 journal of Computer Applications
基金 国家自然科学基金项目 (60 2 0 30 1 1 ) 上海市自然科学基金项目 (7A0 5468)
关键词 离散化 离散格 启发式算法 决策表 discretization discretization lattice heuristic algorithm decision table
分类号 TP181 [自动化与计算机技术—控制理论与控制工程]
  • 相关文献

参考文献7

  • 1[1]Grzymala-Busse JW, Stefanowski J. Three Discretization Methods for Rule Induction[J]. International Journal of Intelligent Systems, 2001,16(1):29-38 .
  • 2[2]Clarke EI, Barton BA. Entropy and MDL Discretization of Continuous Variables for Bayesian Belief Networks[J]. International Journal of Intelligent Systems, 2000,15(1):61-92.
  • 3[3]Susmaga R. Analyzing Discretizations of Continuous Attributes Given a Monotonic Discrimination Function[J]. Intelligent Data Analysis, 1997,1(3):157-179.
  • 4李刚,童頫.基于混合概率模型的无监督离散化算法[J].计算机学报,2002,25(2):158-164. 被引量：16
  • 5王立宏,吴耿锋.信息表的离散格研究[J].模式识别与人工智能,2004,17(1):11-16. 被引量：3
  • 6[6]Wang L, Zhang S, Fan H, et al. The Information Granulation in Discretization[A]. The Second International Conference on Machine Learning and Cybernetics (ICMLC2003)[C], 2003.2620-2623.
  • 7[8]Nguyen, Son H, Skowron A. Quantization of real value attributes[A]. Second Annual Joint Conference on Information Sciences(JCIS'95)[C], 1995.34-37.

二级参考文献23

  • 1[1]Catlett J. On changing continuous attributes into ordered discreteattributes. In: Proc European Working Session on Learning (EWSL91). LNAI-482, Porto,Portugal, 1991. 164-178
  • 2[2]Dougherty J, Kohavi R, Sahami M. Supervised and unsupervised discretizationof continuous features. In: Proc the 12th International Conference, Morgan KaufmannPublishers, 1995.194-202
  • 3[3]Quinlan J R. C4.5: Programs for Machine Learning. San Mateo: Morgan Kaufmann,1993
  • 4[4]Fayyad U, Irani K. Multi-interval discretizaton of continuous-valuedattributes for classification learning. In: Proc the 13th International JointConference on Artificial Intelligence, San Mateo, CA. Morgan Kaufmann Publishers,1993. 1022-1027
  • 5[5]Li G, Tong F. WILD: Weighted information-loss discretization algorithm forordinal attributes. In: Proc Conference on Intelligent Information Processing, the16th IFIP World Computer Congress 2000, Beijing, China, 2000.254-527
  • 6[6]Quinlan J R. Improved use of continuous attributes in C4.5. Journal ofArtificial Intelligence Research, 1996,4(1):77-90
  • 7[7]Wong A K C, Chiu D K Y. Synthesizing statistical knowledge from incompletemixed-mode data. IEEE Trans Pattern Analysis and Machine Intelligence, 1987,PAMI-9(6):796-805
  • 8[8]Banfield J D, Raftery A E. Model based Gaussian and non-Gaussian clustering.Biometrics, 1993,49(3):803-821
  • 9[9]Mackay D J C. Information Theory, Inference and Learning Algorithms.Cambridge: Cambridge University Press, 2000
  • 10[10]Dempster A P, Laird N M, Rubin D B. Maximum likelihood for incomplete data viathe EM algorithm. Journal of the Royal Statistical Society, Series B, 1977,39(1):1-38

共引文献16

同被引文献15

引证文献2

二级引证文献11

计算机应用
2004年 第8期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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