Backward induction for web mining in data warehouse environment데이터 웨어하우스 환경 하의 웹 마이닝을 위한 역진 귀납

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 659
  • Download : 0
For web mining, the biggest problem is the scarcity of data. All web mining procedures starts with the identification of the needed data items. To overcome the problem and prepare as many needed data as possible for business intelligent information, we propose backward induction procedures in web mining. Backward induction itself emphasizes the importance of data preparation in all stages of web mining. It identifies the needed data items before the mining stages with the given suitable procedures. Web mining itself is an iterative process where data mining techniques are used back and forth and iteratively. To support backward induction and other web mining characteristics, the concept of scalability is very important. To accomodate the scalability needed in web mining process, we propose the reference web mining architecture in data warehouse environment. The referred web mining architecture has three kinds of scalabilities: the scalabilities of operational databases, the scalabilities of data model and the scalabilities of data mining engines. By following the backward induction procedures in web mining process, we can extract the business intelligent information from web mining.
Advisors
Moon, Song-Chunresearcher문송천researcher
Description
한국과학기술원 : 경영공학전공,
Publisher
한국과학기술원
Issue Date
2001
Identifier
165980/325007 / 000993539
Language
eng
Description

학위논문(석사) - 한국과학기술원 : 경영공학전공, 2001.2, [ 90 p. ]

Keywords

Web; Database; Data Warehouse; Data Mining; Mining; 마이닝; 데이터베이스; 데이터 웨어하우스; 웹; 데이터 마이닝

URI
http://hdl.handle.net/10203/53587
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=165980&flag=dissertation
Appears in Collection
KGSM-Theses_Master(석사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0