• Title/Summary/Keyword: Temporal Mining

Search Result 120, Processing Time 0.027 seconds

A Study on Storage Analysis of Topyeong Stream Watershed by Washland Construction (천변저류지 조성에 따른 토평천 유역의 저류량 분석)

  • Kim, Jae Chul;Yu, Jae-Jeong;Kim, Sangdan
    • Journal of Wetlands Research
    • /
    • v.10 no.2
    • /
    • pp.39-51
    • /
    • 2008
  • In recent days, the cases of using wetlands in treating waste water, storm events, mining leachate, and agriculture effluents are increasing. But there is the lack of the data for wetlands because of the difficulty in long term monitoring. Such an aspect makes the proper use of wetland impractical. In this study for the purpose of generating a long term hydrologic data, the time series of storage amount for Upo, Mokpo, Sajipo, and Jjokjibeol in Topyeong watershed is simulated using SWAT model. Based on the SWAT-Topyeong model involved in several scenarios for constructing new washlands in Topyeong watershed, the temporal behavior of new washlands is analyzed. It is also revealed that the constructed washland can affect the Upo in some degrees.

  • PDF

Constructing Gene Regulatory Networks using Temporal Relation Rules from 3-Dimensional Gene Expression Data (3차원 유전자 발현 데이터에서의 시간 관계 규칙을 이용한 유전자 상호작용 조절 네트워크 구축)

  • Meijing Li;Jin Hyoung Park;Heon Gyu Lee;Keun Ho Ryu
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.11a
    • /
    • pp.340-343
    • /
    • 2008
  • 유전자들은 복잡한 상호작용을 통해 세포의 기능이 조절된다. 상호작용하는 유전자 그룹들을 유전자 조절 네트워크라고 한다. 기존의 유전자 조절 네트워크는 2D microarray 데이터를 이용하여 시간의 흐름에 따른 유전자간의 상호작용을 알 수가 없었다. 이 논문에서는 시간의 변화에 따른 유전자들 간의 조절관계를 살펴 볼 수 있는 조절네트워크 모델링의 방법을 제시한다. 유전자의 발현양을 표시하기 위해 이진 이산화 방법을 사용하였고 3D microarray 데이터에서 유전자 발현 패턴을 찾기 위해 Cube mining 알고리즘을 적용하였고, 유전자간의 관계를 밝히기 위해 시간 관계 규칙탐사 기법을 사용하여 유전자들 간의 시간 관계를 포함한 유전자 조절네트워크를 구축하였다. 이 연구는 시간의 흐름에 따른 유전자간의 상호작용을 알 수 있으며, 모델링된 조절 네트워크를 이용하여 기능이 아직 발견되지 않은 유전자들의 기능을 예측 할 수 있다.

Temporal Exploration of New Nurses' Field Adaptation Using Text Network Analysis

  • Ahn, Shin Hye;Jeong, Hye Won;Yang, Seong Gyeong;Jung, Ue Seok;Choi, Myoung Lee;Kim, Heui Seon
    • Journal of Korean Academy of Nursing
    • /
    • v.54 no.3
    • /
    • pp.358-371
    • /
    • 2024
  • Purpose: This study aimed to analyze the experiences of new nurses during their first year of hospital employment to gather data for the development of an evidence-based new nurse residency program focused on adaptability. Methods: This study was conducted at a tertiary hospital in Korea between March and August 2021 with 80 new nurses who wrote in critical reflective journals during their first year of work. NetMiner 4.5.0 was used to conduct a text network analysis of the critical reflective journals to uncover core keywords and topics across three periods. Results: In the journals, over time, degree centrality emerged as "study" and "patient understanding" for 1 to 3 months, "insufficient" and "stress" for 4 to 6 months, and "handover" and "preparation" for 7 to 12 months. Major sub-themes at 1 to 3 months were: "rounds," "intravenous-cannulation," "medical device," and "patient understanding"; at 4 to 6 months they were "admission," "discharge," "oxygen therapy," and "disease"; and at 7 to 12 months they were "burden," "independence," and "solution." Conclusion: These results provide valuable insights into the challenges and experiences encountered by new nurses during different stages of their field adaptation process. This information may highlight the best nurse leadership methods for improving institutional education and supporting new nurses' transitions to the hospital work environment.

A Design and Practical Use of Spatial Data Warehouse for Spatiall Decision Making (공간적 의사결정을 위한 공간 데이터 웨어하우스 설계 및 활용)

  • Park Ji-Man;Hwang Chul-sue
    • Spatial Information Research
    • /
    • v.13 no.3 s.34
    • /
    • pp.239-252
    • /
    • 2005
  • The major reason that spatial data warehousing has attracted a great deal of attention in business GIS in recent years is due to the wide availability of huge amount of spatial data and the imminent need for fuming such data into useful geographic information. Therefore, this research has been focused on designing and implementing the pilot tested system for spatial decision making. The purpose of the system is to predict targeted marketing area by discriminating the customers by using both transaction quantity and the number of customer using credit card in department store. Moreover, the pilot tested system of this research provides OLAP tools for interactive analysis of multidimensional data of geographically various granularities, which facilitate effective spatial data mining. focused on the analysis methodology, the case study is aiming to use GIS and clustering for knowledge discovery. Especially, the importance of this study is in the use of snowflake schema model capabilities for GIS framework.

  • PDF

Storage Policies for Versions Management of XML Documents using a Change Set (변경 집합을 이용한 XML 문서의 버전 관리를 위한 저장 기법)

  • Yun Hong Won
    • The KIPS Transactions:PartD
    • /
    • v.11D no.7 s.96
    • /
    • pp.1349-1356
    • /
    • 2004
  • The interest of version management is increasing in electronic commerce requiring data mining and documents processing system related to digital governmentapplications. In this paper, we define a change set that is to manage historicalinformation and to maintain XML documents during a long period of time and propose several storage policies of XML documents using a change set. A change set includes a change oper-ation set and temporal dimensions and a change operation set is composed with schema change operations and data change operations. We pro-pose three storage policies using a change set. Three storage policies are (1) storing all the change sets, (2) storing the change sets and the versions periodically. (3) storing the aggregation of change sets and the versions at a point of proper time. Also, we compare the performance between the existing storage policy and the proposed storage policies. Though the performance evaluation, we show that the method to store the aggregation of change sets and the versions at a point of proper time outperforms others.

Design of Query Processing System to Retrieve Information from Social Network using NLP

  • Virmani, Charu;Juneja, Dimple;Pillai, Anuradha
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.3
    • /
    • pp.1168-1188
    • /
    • 2018
  • Social Network Aggregators are used to maintain and manage manifold accounts over multiple online social networks. Displaying the Activity feed for each social network on a common dashboard has been the status quo of social aggregators for long, however retrieving the desired data from various social networks is a major concern. A user inputs the query desiring the specific outcome from the social networks. Since the intention of the query is solely known by user, therefore the output of the query may not be as per user's expectation unless the system considers 'user-centric' factors. Moreover, the quality of solution depends on these user-centric factors, the user inclination and the nature of the network as well. Thus, there is a need for a system that understands the user's intent serving structured objects. Further, choosing the best execution and optimal ranking functions is also a high priority concern. The current work finds motivation from the above requirements and thus proposes the design of a query processing system to retrieve information from social network that extracts user's intent from various social networks. For further improvements in the research the machine learning techniques are incorporated such as Latent Dirichlet Algorithm (LDA) and Ranking Algorithm to improve the query results and fetch the information using data mining techniques.The proposed framework uniquely contributes a user-centric query retrieval model based on natural language and it is worth mentioning that the proposed framework is efficient when compared on temporal metrics. The proposed Query Processing System to Retrieve Information from Social Network (QPSSN) will increase the discoverability of the user, helps the businesses to collaboratively execute promotions, determine new networks and people. It is an innovative approach to investigate the new aspects of social network. The proposed model offers a significant breakthrough scoring up to precision and recall respectively.

Mining the Up-to-Moment Preference Model based on Partitioned Datasets for Real Time Recommendation (실시간 추천을 위한 분할셋 기반 Up-to-Moment 선호모델 탐색)

  • Han, Jeong-Hye;Byon, Lu-Na
    • Journal of Internet Computing and Services
    • /
    • v.8 no.2
    • /
    • pp.105-115
    • /
    • 2007
  • The up-to-moment dataset is built by combining the past dataset and the recent dataset. The proposal is to compute association rules in real time. This study proposed the model, $EM_{past'}$ and algorithm that is sensitive to time. It can be utilized in real time by applying partitioned combination law after dividing the past dataset into(k-1). Also, we suggested $EM^{ES}_{past}$ applying the exponential smoothing method to $EM^p_{past'}$ When the association rules of $EM_{past'}\;EM^w_{past'\;and\;EM^{ES}_{past}$ were compared, The simulation results showed that $EM^{ES}_{past}$ is most accurate for testing dataset than $EM_{past}$ and $EM^w_{past}$ in huge dataset.

  • PDF

Using Artificial Neural Networks for Forecasting Algae Counts in a Surface Water System

  • Coppola, Emery A. Jr.;Jacinto, Adorable B.;Atherholt, Tom;Poulton, Mary;Pasquarello, Linda;Szidarvoszky, Ferenc;Lohbauer, Scott
    • Korean Journal of Ecology and Environment
    • /
    • v.46 no.1
    • /
    • pp.1-9
    • /
    • 2013
  • Algal blooms in potable water supplies are becoming an increasingly prevalent and serious water quality problem around the world. In addition to precipitating taste and odor problems, blooms damage the environment, and some classes like cyanobacteria (blue-green algae) release toxins that can threaten human health, even causing death. There is a recognized need in the water industry for models that can accurately forecast in real-time algal bloom events for planning and mitigation purposes. In this study, using data for an interconnected system of rivers and reservoirs operated by a New Jersey water utility, various ANN models, including both discrete prediction and classification models, were developed and tested for forecasting counts of three different algal classes for one-week and two-weeks ahead periods. Predictor model inputs included physical, meteorological, chemical, and biological variables, and two different temporal schemes for processing inputs relative to the prediction event were used. Despite relatively limited historical data, the discrete prediction ANN models generally performed well during validation, achieving relatively high correlation coefficients, and often predicting the formation and dissipation of high algae count periods. The ANN classification models also performed well, with average classification percentages averaging 94 percent accuracy. Despite relatively limited data events, this study demonstrates that with adequate data collection, both in terms of the number of historical events and availability of important predictor variables, ANNs can provide accurate real-time forecasts of algal population counts, as well as foster increased understanding of important cause and effect relationships, which can be used to both improve monitoring programs and forecasting efforts.

Analysis and Prediction Algorithms on the State of User's Action Using the Hidden Markov Model in a Ubiquitous Home Network System (유비쿼터스 홈 네트워크 시스템에서 은닉 마르코프 모델을 이용한 사용자 행동 상태 분석 및 예측 알고리즘)

  • Shin, Dong-Kyoo;Shin, Dong-Il;Hwang, Gu-Youn;Choi, Jin-Wook
    • Journal of Internet Computing and Services
    • /
    • v.12 no.2
    • /
    • pp.9-17
    • /
    • 2011
  • This paper proposes an algorithm that predicts the state of user's next actions, exploiting the HMM (Hidden Markov Model) on user profile data stored in the ubiquitous home network. The HMM, recognizes patterns of sequential data, adequately represents the temporal property implicated in the data, and is a typical model that can infer information from the sequential data. The proposed algorithm uses the number of the user's action performed, the location and duration of the actions saved by "Activity Recognition System" as training data. An objective formulation for the user's interest in his action is proposed by giving weight on his action, and change on the state of his next action is predicted by obtaining the change on the weight according to the flow of time using the HMM. The proposed algorithm, helps constructing realistic ubiquitous home networks.

A Study on the CBR Pattern using Similarity and the Euclidean Calculation Pattern (유사도와 유클리디안 계산패턴을 이용한 CBR 패턴연구)

  • Yun, Jong-Chan;Kim, Hak-Chul;Kim, Jong-Jin;Youn, Sung-Dae
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.4
    • /
    • pp.875-885
    • /
    • 2010
  • CBR (Case-Based Reasoning) is a technique to infer the relationships between existing data and case data, and the method to calculate similarity and Euclidean distance is mostly frequently being used. However, since those methods compare all the existing and case data, it also has a demerit that it takes much time for data search and filtering. Therefore, to solve this problem, various researches have been conducted. This paper suggests the method of SE(Speed Euclidean-distance) calculation that utilizes the patterns discovered in the existing process of computing similarity and Euclidean distance. Because SE calculation applies the patterns and weight found during inputting new cases and enables fast data extraction and short operation time, it can enhance computing speed for temporal or spatial restrictions and eliminate unnecessary computing operation. Through this experiment, it has been found that the proposed method improves performance in various computer environments or processing rate more efficiently than the existing method that extracts data using similarity or Euclidean method does.