복잡계 네트워크를 활용한 건설분야 미래 주요키워드 분석Analysis of foresight keywords in construction using complexity network method
- Other Titles
- Analysis of foresight keywords in construction using complexity network method
- Authors
- 정철우; 김재준
- Issue Date
- Jun-2012
- Publisher
- 한국디지털건축·인테리어학회
- Keywords
- Complexity Network; Foresight; 복잡계 네트워크; 미래예측
- Citation
- 한국디지털건축인테리어학회 논문집, v.12, no.2, pp.15 - 23
- Indexed
- KCI
OTHER
- Journal Title
- 한국디지털건축인테리어학회 논문집
- Volume
- 12
- Number
- 2
- Start Page
- 15
- End Page
- 23
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/165330
- ISSN
- 1738-0790
- Abstract
- Today, rapid changes in technologies and everyday lives due to the Internet make it is difficult to make predictions about the future. Generally, the best way to predict the future has been proposed by experts. Although expert opinions are very important, they are liable to produce incorrect results due to human error, insufficient information regarding future outcomes and a state of connectedness between people, among other reasons. One of the ways to reduce these mistakes is to provide objective information to the experts. There are many studies that focus on the collection of objective material from papers, patents, reports and the Internet, among other sources. This research paper seeks to develop a forecasting method using World Wide Web search results according to the Google search engine and a network analysis, which is generally used to analyze a social network analysis(SNA). In particular, this paper provides a method to analyze a complexity network and to discover important technologies in the construction field. This approach may make it possible to enhance the overall performance of forecasting method and help us understand the complex system.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 건축공학부 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/165330)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.