• Journal of Digital Convergence
• /
• v.14 no.8
• /
• pp.57-67
• /
• 2016

As the Internet is becoming more socialized, Korean government, publishing a slogan, Government 3.0, has recently began to find a way to deliver its administration services to the public in more personalized manner. Policy directions to implement this advanced idea, are however still at large, primarily because of the vague nature of 'personalized'. This study, therefore, explores the possibility of getting public administrative services closer to personalization. To achieve this objective, this study attempts to develop a integrative framework of classifying the administration services to the public, based on two dimensions - the degree of citizen-oriented and the degree of government-driven, both of which are perhaps key determinants of personaliztion of services. For each quadrant of the framework, key features, characteristics, and conditions to be met are explained and followed by exemplary cases and policy implications.

• Journal of Intelligence and Information Systems
• /
• v.18 no.1
• /
• pp.91-107
• /
• 2012

As the Internet becomes more popular, many people use it to communicate. With the increasing number of personal homepages, blogs, and social network services, people often expose their personal information online. Although the necessity of those services cannot be denied, we should be concerned about the negative aspects such as personal information leakage. Because it is impossible to review all of the past records posted by all of the people, an automatic personal information detection method is strongly required. This study proposes a method to detect or classify online documents that contain personal information by analyzing features that are common to personal information related documents and learning that information based on the Na$\ddot{i}$ve Bayes algorithm. To select the document classification algorithm, the Na$\ddot{i}$ve Bayes classification algorithm was compared with the Vector Space classification algorithm. The result showed that Na$\ddot{i}$ve Bayes reveals more excellent precision, recall, F-measure, and accuracy than Vector Space does. However, the measurement level of the Na$\ddot{i}$ve Bayes classification algorithm is still insufficient to apply to the real world. Lewis, a learning algorithm researcher, states that it is important to improve the quality of category features while applying learning algorithms to some specific domain. He proposes a way to incrementally add features that are dependent on related documents and in a step-wise manner. In another experiment, the algorithm learns the additional dependent features thereby reducing the noise of the features. As a result, the latter experiment shows better performance in terms of measurement than the former experiment does.

• The KIPS Transactions:PartB
• /
• v.18B no.5
• /
• pp.325-332
• /
• 2011

Social Network Services(SNS) such as Twitter, Facebook and Myspace have gained popularity worldwide. Especially, sentiment analysis of SNS users' sentence is very important since it is very useful in the opinion mining. In this paper, we propose a new sentiment classification method of sentences which contains formal and informal vocabulary such as emoticons, and newly coined words. Previous methods used only formal vocabulary to classify sentiments of sentences. However, these methods are not quite effective because internet users use sentences that contain informal vocabulary. In addition, we construct suggest to construct domain sentiment vocabulary because the same word may represent different sentiments in different domains. Feature vectors are extracted from the sentiment vocabulary information and classified by Support Vector Machine(SVM). Our proposed method shows good performance in classification accuracy.

• The Journal of Society for e-Business Studies
• /
• v.22 no.2
• /
• pp.61-77
• /
• 2017

Recently, the number of academic conference information on the Internet has rapidly increased, the automatic classification of academic conference information according to research subjects enables researchers to find the related academic conference efficiently. Information provided by most conference listing services is limited to title, date, location, and website URL. However, among these features, the only feature containing topical words is title, which causes information insufficiency problem. Therefore, we propose methods that aim to resolve information insufficiency problem by utilizing web contents. Specifically, the proposed methods the extract main contents from a HTML document collected by using a website URL. Based on the similarity between the title of a conference and its main contents, the topical keywords are selected to enforce the important keywords among the main contents. The experiment results conducted by using a real-world dataset showed that the use of additional information extracted from the conference websites is successful in improving the conference classification performances. We plan to further improve the accuracy of conference classification by considering the structure of websites.

• International journal of advanced smart convergence
• /
• v.11 no.1
• /
• pp.111-116
• /
• 2022

After COVID-19, the number of people with sleep disorders around the world is increasing. In particular, in the flow of the 4th industrial revolution, the differentiation of types and characteristics of the sleep industry is accelerating. Therefore, in this study, the characteristics of each type of sleep-related industry were reclassified from an industrial point of view, and based on this, an attempt was made to review the classification system that can help companies develop sleep products and improve related national systems. Based on the 10th standard industry classification, we compared input cost, value, and usability and analyzed common characteristics, treatments, and preventive effects based on this. A comprehensive taxonomy using matrix analysis was reviewed. As a result, in terms of cost (A), the most common sleeping products are general mattresses and general bedding. It is an IOT device (auxiliary device), and the value aspect (B, B/D) included sleep cafe, bedding rental and management service, and sleep consulting. In terms of utility (A/B), a total of 6 product groups including sleep aids (health functional foods) belong to this category, and in terms of treatment (A/C), a total of 3 product groups including sleep clinics (medical services) belong to this category. As for the product group (A/D) with both properties, it was found that non-insurance sleep treatment medical devices, sleep-related over-the-counter drugs, and some sleep monitoring applications belong to this category. Ultimately, it was found that the sleep industry classification enables the most active product development and composition according to the relative relationship between cost and utility, and treatment and utility. appeared to be necessary.

• Journal of Internet Computing and Services
• /
• v.8 no.3
• /
• pp.131-143
• /
• 2007

The current trends in information technology and intelligent systems use data mining techniques to discover patterns and extract rules from distributed databases. In distributed environment, the extracted rules from data mining techniques can be used in dynamic replications, adaptive load balancing and other schemes. However, transmission of large data through the system can cause errors and unreliable results. This paper proposes the intelligent distributed platform based on dynamic group binding using mobile agents which addresses the use of intelligence in distributed environment. The proposed grouping service implements classification scheme of objects. Data compressor agent and data miner agent extracts rules and compresses data, respectively, from the service node databases. The proposed algorithm performs preprocessing where it merges the less frequent dataset using neuro-fuzzy classifier before sending the data. Object group classification, data mining the service node database, data compression method, and rule extraction were simulated. Result of experiments in efficient data compression and reliable rule extraction shows that the proposed algorithm has better performance compared to other methods.

• Journal of Internet Computing and Services
• /
• v.18 no.1
• /
• pp.1-9
• /
• 2017

Innovations from current researches on cloud computing such as applying bio-inspired computing techniques have brought new level solutions in offloading mechanisms. With the growing trend of mobile devices, mobile cloud computing can also benefit from applying bio-inspired techniques. Energy-efficient offloading mechanisms on mobile cloud systems are needed to reduce the total energy consumption but previous works did not consider energy consumption in the decision-making of task distribution. This paper proposes the Particle Swarm Optimization (PSO) as an offloading strategy of cloudlet to data centers where each task is represented as a particle during the process. The collected tasks are classified using K-means clustering on the cloudlet before applying PSO in order to minimize the number of particles and to locate the best data center for a specific task, instead of considering all tasks during the PSO process. Simulation results show that the proposed PSO excels in choosing data centers with respect to energy consumption, while it has accumulated a little more processing time compared to the other approaches.

• Journal of Internet Computing and Services
• /
• v.17 no.2
• /
• pp.49-57
• /
• 2016

Ensemble classification involves combining multiple classifiers to obtain more accurate predictions than those obtained using individual models. Ensemble learning techniques are known to be very useful for improving prediction accuracy. Bagging is one of the most popular ensemble learning techniques. Bagging has been known to be successful in increasing the accuracy of prediction of the individual classifiers. Bagging draws bootstrap samples from the training sample, applies the classifier to each bootstrap sample, and then combines the predictions of these classifiers to get the final classification result. Bootstrap samples are simple random samples selected from the original training data, so not all bootstrap samples are equally informative, due to the randomness. In this study, we proposed a new method for improving the performance of the standard bagging ensemble by optimizing bootstrap samples. A genetic algorithm is used to optimize bootstrap samples of the ensemble for improving prediction accuracy of the ensemble model. The proposed model is applied to a bankruptcy prediction problem using a real dataset from Korean companies. The experimental results showed the effectiveness of the proposed model.

• Journal of Internet Computing and Services
• /
• v.20 no.5
• /
• pp.1-8
• /
• 2019

This paper carried out a study to reduce damage from jellyfish whose population has increased due to global warming. The emergence of jellyfish on the beach could result in casualties from jellyfish stings and economic losses from closures. This paper confirmed from the preceding studies that the pattern of jellyfish's appearance is predictable through machine learning. This paper is an extension of The prediction model of emergence of Busan coastal jellyfish using SVM. In this paper, we used deep neural network to expand from the existing methods of predicting the existence of jellyfish to the classification by index. Due to the limitations of the small amount of data collected, the 84.57% prediction accuracy limit was sought to be resolved through data expansion using bootstraping. The expanded data showed about 7% higher performance than the original data, and about 6% better performance compared to the transfer learning. Finally, we used the test data to confirm the prediction performance of jellyfish appearance. As a result, although it has been confirmed that jellyfish emergence binary classification can be predicted with high accuracy, predictions through indexation have not produced meaningful results.

• Journal of Internet Computing and Services
• /
• v.25 no.2
• /
• pp.1-9
• /
• 2024

Although federated learning is designed to be safer than centralized methods in terms of security and privacy, it still has many vulnerabilities. An attacker performing an adversarial attack intentionally manipulates the deep learning model by injecting carefully crafted input data, that is, adversarial examples, into the client's training data to induce misclassification. A common defense strategy against this is so-called adversarial training, which involves preemptively learning the characteristics of adversarial examples into the model. Existing research assumes a scenario where all clients are under adversarial attack, but considering the number of clients in federated learning is very large, this is far from reality. In this paper, we experimentally examine aspects of adversarial training in a scenario where some of the clients are under attack. Through experiments, we found that there is a trade-off relationship in which the classification accuracy for normal samples decreases as the classification accuracy for adversarial examples increases. In order to effectively utilize this trade-off relationship, we present a method to perform adversarial training by adaptively selecting a loss function depending on whether the client is attacked.