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

浅谈数据仓库与数据挖掘的本科教学 被引量：9

A Brief Discussion on Database and Data Mining for Undergraduate Education
下载PDF
导出
摘要 根据在大学计算机类和经济管理类本科生中教授数据仓库与数据挖掘课程中存在的问题及特点,提出在教学中要根据计算机类和经济管理类本科生的不同特点展开教学,对计算机类的学生应侧重算法和设计,而对管理类的学生则应侧重具体应用。 Based on the problems and the features in database and data mining Courses taught to undergraduates majoring in computer science and economics ＆ administration,the article suggests that teaching should be carried out in accordance with the different characteristics of students majoring in computer science and economics ＆ administration. Emphasis should be placed on algorithms and design for students of computer science, while for students of economics administration,stress should be laid on the specific application of algorithms.
作者 胡建军
机构地区 广东商学院信息学院
出处 《广西科学院学报》 2007年第3期209-210,214,共3页 Journal of Guangxi Academy of Sciences
关键词 数据仓库 数据挖掘 本科教学 database, data mining, undergraduate education
分类号 TP311 [自动化与计算机技术—计算机软件与理论]
  • 相关文献

参考文献4

  • 1曾华军,张银奎.机器学习机[M].北京:机械工业出版社,2005:10-13.
  • 2韩家炜 范明 孟小峰.数据挖掘概念与技术[M].北京：机械工业出版社,2001..
  • 3AGRAWAL R,WRIKANT R.Fast Algorithms for mining association rules in large databases[C].Proc,20th int'l Conf Very large databases,1994:478-499.
  • 4胡建军,唐常杰,李川,彭京,元昌安,陈安龙,蒋永光.基于最近邻优先的高效聚类算法[J].四川大学学报（工程科学版）,2004,36(6):93-99. 被引量：24

二级参考文献8

  • 1Han J W, Kambr M. Data mining concepts and techniques[M]. Beijing: Higher Education Press, 2001. 145～176.[2]Kaufan L, Rousseeuw P J. Finding groups in data: an introduction to cluster analysis[M]. New York: John Wiley & Sons, 1990.
  • 2Guha S, Rastogi R, Shim K. CURE: an efficient clustering algorithm for large databases[A]. Haas L M, Tiwary A. Proceedings of the ACM SIGMOD International Conference on Management of Data[C]. Seattle: ACM Press, 1998. 73～84.
  • 3Ester M, Kriegel H P, Sander J, et al. A density based algorithm for discovering clusters in large spatial databases with noise[A]. Simoudis E, Han J W, Fayyad U M. Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining[C].
  • 4Agrawal R, Gehrke J, Gunopolos D, et al. Automatic subspace clustering of high dimensional data for data mining application[A]. Haas L M, Tiwary A. Proceedings of the ACM SIGMOD International Conference on Management of Data[C]. Seattle: ACM Press, 1998.
  • 5Zhang T,Ramakrishnan R,Livny M. BIRCH:an efficient data clustering method for very large database[R].Computer Sciences Dept,Univ of Wisconsin-Madison,1995.
  • 6Zhang T,Ramakrishnan R,Livny M. BIRCH:an efficient data clustering method for very large databases[A]. Jagadish H V, Mumick I S. Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data[C]. Quebec: ACM Press, 1996.103～114.
  • 7Beyer K S,Goldstein J,Ramakrishnan R,et al. When is 'nearest neighbor' meaningful?[A].Beeri C,Buneman P.Proceedings of the 7th International Conference on Data Theory[C].ICDT'99. LNCS1540,Jerusalem, Israel: Springer, 1999.217～235.
  • 8Karypis G,Han E H,Kumar V. CHAMELEON: a hierarchical clustering algorithm using dynamic modeling[J].IEEE Computer,1999,32(8):68-75.

共引文献67

同被引文献18

引证文献9

二级引证文献52

广西科学院学报
2007年 第3期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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