• Korean Journal of Radiology
• /
• v.23 no.9
• /
• pp.921-930
• /
• 2022

Objective: To identify epidermal growth factor receptor (EGFR) mutations in lung adenocarcinoma based on ¹⁸F-fluorodeoxyglucose (FDG) PET/CT radiomics and clinical features and to distinguish EGFR exon 19 deletion (19 del) and exon 21 L858R missense (21 L858R) mutations using FDG PET/CT radiomics. Materials and Methods: We retrospectively analyzed 179 patients with lung adenocarcinoma. They were randomly assigned to training (n = 125) and testing (n = 54) cohorts in a 7:3 ratio. A total of 2632 radiomics features were extracted from the tumor region of interest from the PET (1316) and CT (1316) images. Six PET/CT radiomics features that remained after the feature selection step were used to calculate the radiomics model score (rad-score). Subsequently, a combined clinical and radiomics model was constructed based on sex, smoking history, tumor diameter, and rad-score. The performance of the combined model in identifying EGFR mutations was assessed using a receiver operating characteristic (ROC) curve. Furthermore, in a subsample of 99 patients, a PET/CT radiomics model for distinguishing 19 del and 21 L858R EGFR mutational subtypes was established, and its performance was evaluated. Results: The area under the ROC curve (AUROC) and accuracy of the combined clinical and PET/CT radiomics models were 0.882 and 81.6%, respectively, in the training cohort and 0.837 and 74.1%, respectively, in the testing cohort. The AUROC and accuracy of the radiomics model for distinguishing between 19 del and 21 L858R EGFR mutational subtypes were 0.708 and 66.7%, respectively, in the training cohort and 0.652 and 56.7%, respectively, in the testing cohort. Conclusion: The combined clinical and PET/CT radiomics model could identify the EGFR mutational status in lung adenocarcinoma with moderate accuracy. However, distinguishing between EGFR 19 del and 21 L858R mutational subtypes was more challenging using PET/CT radiomics.

• Journal of Practical Engineering Education
• /
• v.16 no.1_spc
• /
• pp.65-70
• /
• 2024

As the interest in AI education grows, researchers have made efforts to implement AI education programs. However, research targeting pre-service teachers has been limited thus far. Therefore, this study was conducted to develop an AI literacy education program for preservice secondary teachers. The research results revealed that the weekly topics included the definition and applications of AI, analysis of intelligent agents, the importance of data, understanding machine learning, hands-on exercises on prediction and classification, hands-on exercises on clustering and classification, hands-on exercises on unstructured data, understanding deep learning, application of deep learning algorithms, fairness, transparency, accountability, safety, and social integration. Through this research, it is hoped that AI literacy education programs for preservice teachers will be expanded. In the future, it is anticipated that follow-up studies will be conducted to implement relevant education in teacher training institutions and analyze its effectiveness.

• Journal of the Microelectronics and Packaging Society
• /
• v.31 no.1
• /
• pp.23-28
• /
• 2024

Electronic products utilizing flexible devices experience harsh mechanical deformations in real-use environments. As a result, researches on the mechanical reliability of these flexible devices have attracted considerable interest among researchers. This study employed previous bending strain models and finite element analysis to predict the maximum bending strain of metal films deposited on flexible substrates. Bending experiments were simulated using finite element analysis with variations in the material and thickness of the thin films, and the substrate thickness. The results were compared with the strains predicted by existing models. The distribution of strain on the surface of film was observed, and the error rate of the existing model was analyzed during bending. Additionally, a modified model was proposed, providing mathematical constants for each case.

• Journal of radiological science and technology
• /
• v.47 no.1
• /
• pp.29-37
• /
• 2024

This study aims to evaluate the performance of the U-Net based learning model that may vary depending on the histogram equalization algorithm. The subject of the experiment were 17 radiology students of this college, and 1,727 data sets in which the region of interest was set in the thyroid after acquiring ultrasound image data were used. The training set consisted of 1,383 images, the validation set consisted of 172 and the test data set consisted of 172. The equalization algorithm was divided into Histogram Equalization(HE) and Contrast Limited Adaptive Histogram Equalization(CLAHE), and according to the clip limit, it was divided into CLAHE8-1, CLAHE8-2. CLAHE8-3. Deep Learning was learned through size control, histogram equalization, Z-score normalization, and data augmentation. As a result of the experiment, the Attention U-Net showed the highest performance from CLAHE8-2 to 0.8355, and the U-Net and BSU-Net showed the highest performance from CLAHE8-3 to 0.8303 and 0.8277. In the case of mIoU, the Attention U-Net was 0.7175 in CLAHE8-2, the U-Net was 0.7098 and the BSU-Net was 0.7060 in CLAHE8-3. This study attempted to confirm the effects of U-Net, Attention U-Net, and BSU-Net models when histogram equalization is performed on ultrasound images. The increase in Clip Limit can be expected to increase the ROI match with the prediction mask by clarifying the boundaries, which affects the improvement of the contrast of the thyroid area in deep learning model learning, and consequently affects the performance improvement.

• Journal of Intelligence and Information Systems
• /
• v.19 no.1
• /
• pp.57-77
• /
• 2013

Social media has become one of the most popular media in web and mobile application. In 2011, social networks and blogs are still the top destination of online users, according to a study from Nielsen Company. In their studies, nearly 4 in 5active users visit social network and blog. Social Networks and Blogs sites rule Americans' Internet time, accounting to 23 percent of time spent online. Facebook is the main social network that the U.S internet users spend time more than the other social network services such as Yahoo, Google, AOL Media Network, Twitter, Linked In and so on. In recent trend, most of the companies promote their products in the Facebook by creating the "Facebook Page" that refers to specific product. The "Like" option allows user to subscribed and received updates their interested on from the page. The film makers which produce a lot of films around the world also take part to market and promote their films by exploiting the advantages of using the "Facebook Page". In addition, a great number of streaming service providers allows users to subscribe their service to watch and enjoy movies and TV program. They can instantly watch movies and TV program over the internet to PCs, Macs and TVs. Netflix alone as the world's leading subscription service have more than 30 million streaming members in the United States, Latin America, the United Kingdom and the Nordics. As the matter of facts, a million of movies and TV program with different of genres are offered to the subscriber. In contrast, users need spend a lot time to find the right movies which are related to their interest genre. Recent years there are many researchers who have been propose a method to improve prediction the rating or preference that would give the most related items such as books, music or movies to the garget user or the group of users that have the same interest in the particular items. One of the most popular methods to build recommendation system is traditional Collaborative Filtering (CF). The method compute the similarity of the target user and other users, which then are cluster in the same interest on items according which items that users have been rated. The method then predicts other items from the same group of users to recommend to a group of users. Moreover, There are many items that need to study for suggesting to users such as books, music, movies, news, videos and so on. However, in this paper we only focus on movie as item to recommend to users. In addition, there are many challenges for CF task. Firstly, the "sparsity problem"; it occurs when user information preference is not enough. The recommendation accuracies result is lower compared to the neighbor who composed with a large amount of ratings. The second problem is "cold-start problem"; it occurs whenever new users or items are added into the system, which each has norating or a few rating. For instance, no personalized predictions can be made for a new user without any ratings on the record. In this research we propose a clustering method according to the users' genre interest extracted from social network service (SNS) and user's movies rating information system to solve the "cold-start problem." Our proposed method will clusters the target user together with the other users by combining the user genre interest and the rating information. It is important to realize a huge amount of interesting and useful user's information from Facebook Graph, we can extract information from the "Facebook Page" which "Like" by them. Moreover, we use the Internet Movie Database(IMDb) as the main dataset. The IMDbis online databases that consist of a large amount of information related to movies, TV programs and including actors. This dataset not only used to provide movie information in our Movie Rating Systems, but also as resources to provide movie genre information which extracted from the "Facebook Page". Formerly, the user must login with their Facebook account to login to the Movie Rating System, at the same time our system will collect the genre interest from the "Facebook Page". We conduct many experiments with other methods to see how our method performs and we also compare to the other methods. First, we compared our proposed method in the case of the normal recommendation to see how our system improves the recommendation result. Then we experiment method in case of cold-start problem. Our experiment show that our method is outperform than the other methods. In these two cases of our experimentation, we see that our proposed method produces better result in case both cases.

• Journal of Intelligence and Information Systems
• /
• v.21 no.4
• /
• pp.1-16
• /
• 2015

Traffic accident is one of the major cause of death worldwide for the last several decades. According to the statistics of world health organization, approximately 1.24 million deaths occurred on the world's roads in 2010. In order to reduce future traffic accident, multipronged approaches have been adopted including traffic regulations, injury-reducing technologies, driving training program and so on. Records on traffic accidents are generated and maintained for this purpose. To make these records meaningful and effective, it is necessary to analyze relationship between traffic accident and related factors including vehicle design, road design, weather, driver behavior etc. Insight derived from these analysis can be used for accident prevention approaches. Traffic accident data mining is an activity to find useful knowledges about such relationship that is not well-known and user may interested in it. Many studies about mining accident data have been reported over the past two decades. Most of studies mainly focused on predict risk of accident using accident related factors. Supervised learning methods like decision tree, logistic regression, k-nearest neighbor, neural network are used for these prediction. However, derived prediction model from these algorithms are too complex to understand for human itself because the main purpose of these algorithms are prediction, not explanation of the data. Some of studies use unsupervised clustering algorithm to dividing the data into several groups, but derived group itself is still not easy to understand for human, so it is necessary to do some additional analytic works. Rule based learning methods are adequate when we want to derive comprehensive form of knowledge about the target domain. It derives a set of if-then rules that represent relationship between the target feature with other features. Rules are fairly easy for human to understand its meaning therefore it can help provide insight and comprehensible results for human. Association rule learning methods and subgroup discovery methods are representing rule based learning methods for descriptive task. These two algorithms have been used in a wide range of area from transaction analysis, accident data analysis, detection of statistically significant patient risk groups, discovering key person in social communities and so on. We use both the association rule learning method and the subgroup discovery method to discover useful patterns from a traffic accident dataset consisting of many features including profile of driver, location of accident, types of accident, information of vehicle, violation of regulation and so on. The association rule learning method, which is one of the unsupervised learning methods, searches for frequent item sets from the data and translates them into rules. In contrast, the subgroup discovery method is a kind of supervised learning method that discovers rules of user specified concepts satisfying certain degree of generality and unusualness. Depending on what aspect of the data we are focusing our attention to, we may combine different multiple relevant features of interest to make a synthetic target feature, and give it to the rule learning algorithms. After a set of rules is derived, some postprocessing steps are taken to make the ruleset more compact and easier to understand by removing some uninteresting or redundant rules. We conducted a set of experiments of mining our traffic accident data in both unsupervised mode and supervised mode for comparison of these rule based learning algorithms. Experiments with the traffic accident data reveals that the association rule learning, in its pure unsupervised mode, can discover some hidden relationship among the features. Under supervised learning setting with combinatorial target feature, however, the subgroup discovery method finds good rules much more easily than the association rule learning method that requires a lot of efforts to tune the parameters.

• Korean Journal of Agricultural and Forest Meteorology
• /
• v.23 no.4
• /
• pp.374-390
• /
• 2021

Growth and yield of field vegetable crops would be affected by climate conditions, which cause a relatively large fluctuation in crop production and consumer price over years. The yield prediction system for these crops would support decision-making on policies to manage supply and demands. The objectives of this study were to compile literatures related to onion and garlic and to perform data-mining analysis, which would shed lights on the development of crop models for these major field vegetable crops in Korea. The literatures on crop growth and yield were collected from the databases operated by Research Information Sharing Service, National Science & Technology Information Service and SCOPUS. The keywords were chosen to retrieve research outcomes related to crop growth and yield of onion and garlic. These literatures were analyzed using text mining approaches including word cloud and semantic networks. It was found that the number of publications was considerably less for the field vegetable crops compared with rice. Still, specific patterns between previous research outcomes were identified using the text mining methods. For example, climate change and remote sensing were major topics of interest for growth and yield of onion and garlic. The impact of temperature and irrigation on crop growth was also assessed in the previous studies. It was also found that yield of onion and garlic would be affected by both environment and crop management conditions including sowing time, variety, seed treatment method, irrigation interval, fertilization amount and fertilizer composition. For meteorological conditions, temperature, precipitation, solar radiation and humidity were found to be the major factors in the literatures. These indicate that crop models need to take into account both environmental and crop management practices for reliable prediction of crop yield.

• Korean Journal of Agricultural and Forest Meteorology
• /
• v.24 no.3
• /
• pp.164-178
• /
• 2022

Uncertainties in weather forecasts would affect the reliability of yield prediction using crop models. The objective of this study was to compare uncertainty in crop yield prediction caused by the use of the weather forecast data. Daily weather data were produced at 10 km spatial resolution using W eather Research and Forecasting (W RF) model. The nearest neighbor method was used to downscale these data at the resolution of 5 km (W RF5K). Parameter-elevation Regressions on Independent Slopes Model (PRISM) was also applied to the WRF data to produce the weather data at the same resolution. W RF5K and PRISM data were used as inputs to the CROPGRO-SOYBEAN model to predict crop yield. The uncertainties of the gridded data were analyzed using cumulative growing degree days (CGDD) and cumulative solar radiation (CSRAD) during the soybean growing seasons for the crop of interest. The degree of agreement (DOA) statistics including structural similarity index were determined for the crop model outputs. Our results indicated that the DOA statistics for CGDD were correlated with that for the maturity dates predicted using WRF5K and PRISM data. Yield forecasts had small values of the DOA statistics when large spatial disagreement occured between maturity dates predicted using WRF5K and PRISM. These results suggest that the spatial uncertainties in temperature data would affect the reliability of the phenology and, as a result, yield predictions at a greater degree than those in solar radiation data. This merits further studies to assess the uncertainties of crop yield forecasts using a wide range of crop calendars.

• Journal of Intelligence and Information Systems
• /
• v.19 no.3
• /
• pp.57-71
• /
• 2013

Over a billion people in the world generate new news minute by minute. People forecasts some news but most news are from unexpected events such as natural disasters, accidents, crimes. People spend much time to watch a huge amount of news delivered from many media because they want to understand what is happening now, to predict what might happen in the near future, and to share and discuss on the news. People make better daily decisions through watching and obtaining useful information from news they saw. However, it is difficult that people choose news suitable to them and obtain useful information from the news because there are so many news media such as portal sites, broadcasters, and most news articles consist of gossipy news and breaking news. User interest changes over time and many people have no interest in outdated news. From this fact, applying users' recent interest to personalized news service is also required in news service. It means that personalized news service should dynamically manage user profiles. In this paper, a content-based news recommendation system is proposed to provide the personalized news service. For a personalized service, user's personal information is requisitely required. Social network service is used to extract user information for personalization service. The proposed system constructs dynamic user profile based on recent user information of Facebook, which is one of social network services. User information contains personal information, recent articles, and Facebook Page information. Facebook Pages are used for businesses, organizations and brands to share their contents and connect with people. Facebook users can add Facebook Page to specify their interest in the Page. The proposed system uses this Page information to create user profile, and to match user preferences to news topics. However, some Pages are not directly matched to news topic because Page deals with individual objects and do not provide topic information suitable to news. Freebase, which is a large collaborative database of well-known people, places, things, is used to match Page to news topic by using hierarchy information of its objects. By using recent Page information and articles of Facebook users, the proposed systems can own dynamic user profile. The generated user profile is used to measure user preferences on news. To generate news profile, news category predefined by news media is used and keywords of news articles are extracted after analysis of news contents including title, category, and scripts. TF-IDF technique, which reflects how important a word is to a document in a corpus, is used to identify keywords of each news article. For user profile and news profile, same format is used to efficiently measure similarity between user preferences and news. The proposed system calculates all similarity values between user profiles and news profiles. Existing methods of similarity calculation in vector space model do not cover synonym, hypernym and hyponym because they only handle given words in vector space model. The proposed system applies WordNet to similarity calculation to overcome the limitation. Top-N news articles, which have high similarity value for a target user, are recommended to the user. To evaluate the proposed news recommendation system, user profiles are generated using Facebook account with participants consent, and we implement a Web crawler to extract news information from PBS, which is non-profit public broadcasting television network in the United States, and construct news profiles. We compare the performance of the proposed method with that of benchmark algorithms. One is a traditional method based on TF-IDF. Another is 6Sub-Vectors method that divides the points to get keywords into six parts. Experimental results demonstrate that the proposed system provide useful news to users by applying user's social network information and WordNet functions, in terms of prediction error of recommended news.

• Journal of Korean Society of Coastal and Ocean Engineers
• /
• v.26 no.6
• /
• pp.405-412
• /
• 2014

A number of algal bloom models (red-tide models) have been developed and applied to simulate the redtide growth and decline patterns as the interest on the phytoplankton blooms has been continuously increased. The quantitative error analysis of the model is of great importance because the accurate prediction of the red-tide occurrence and transport pattern can be used to setup the effective mitigations and counter-measures on the coastal ecosystem, aquaculture and fisheries damages. The word "red-tide model" is widely used without any clear definitions and references. It makes the comparative evaluation of the ecological models difficult and confusable. It is highly required to do the performance test of the red-tide models based on the suitable classification and appropriate error analysis because model structures are different even though the same/similar words (e.g., red-tide, algal bloom, phytoplankton growth, ecological or ecosystem models) are used. Thus, the references on the model classification are suggested and the advantage and disadvantage of the models are also suggested. The processes and methods on the performance test (quantitative error analysis) are recommend to the practical use of the red-tide model in the coastal seas. It is suggested in each stage of the modeling procedures, such as verification, calibration, validation, and application steps. These suggested references and methods can be attributed to the effective/efficient marine policy decision and the coastal ecosystem management plan setup considering the red-tide and/or ecological models uncertainty.