The Kips Transactions:partb最新文献

筛选
英文 中文
Research on the modified algorithm for improving accuracy of Random Forest classifier which identifies automatically arrhythmia 提高随机森林分类器心律失常自动识别准确率的改进算法研究
The Kips Transactions:partb Pub Date : 2011-12-31 DOI: 10.3745/KIPSTB.2011.18B.6.341
Hyunju Lee, Dongkyoo Shin, HeeWon Park, Soohan Kim, Dongil Shin
{"title":"Research on the modified algorithm for improving accuracy of Random Forest classifier which identifies automatically arrhythmia","authors":"Hyunju Lee, Dongkyoo Shin, HeeWon Park, Soohan Kim, Dongil Shin","doi":"10.3745/KIPSTB.2011.18B.6.341","DOIUrl":"https://doi.org/10.3745/KIPSTB.2011.18B.6.341","url":null,"abstract":"ECG(Electrocardiogram), a field of Bio-signal, is generally experimented with classification algorithms most of which are SVM(Support Vector Machine), MLP(Multilayer Perceptron). But this study modified the Random Forest Algorithm along the basis of signal characteristics and comparatively analyzed the accuracies of modified algorithm with those of SVM and MLP to prove the ability of modified algorithm. The R-R interval extracted from ECG is used in this study and the results of established researches which experimented co-equal data are also comparatively analyzed. As a result, modified RF Classifier showed better consequences than SVM classifier, MLP classifier and other researches' results in accuracy category. The Band-pass filter is used to extract R-R interval in pre-processing stage. However, the Wavelet transform, median filter, and finite impulse response filter in addition to Band-pass filter are often used in experiment of ECG. After this study, selection of the filters efficiently deleting the baseline wandering in pre-processing stage and study of the methods correctly extracting the R-R interval are needed.","PeriodicalId":122700,"journal":{"name":"The Kips Transactions:partb","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129870595","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Performance Comparison between Neural Network Model and Statistical Model for Prediction of Damage Cost from Storm and Flood 神经网络模型与统计模型在暴雨洪水灾害损失预测中的性能比较
The Kips Transactions:partb Pub Date : 2011-10-31 DOI: 10.3745/KIPSTB.2011.18B.5.271
Seonhwa Choi
{"title":"Performance Comparison between Neural Network Model and Statistical Model for Prediction of Damage Cost from Storm and Flood","authors":"Seonhwa Choi","doi":"10.3745/KIPSTB.2011.18B.5.271","DOIUrl":"https://doi.org/10.3745/KIPSTB.2011.18B.5.271","url":null,"abstract":"Storm and flood such as torrential rains and major typhoons has often caused damages on a large scale in Korea and damages from storm and flood have been increasing by climate change and warming. Therefore, it is an essential work to maneuver preemptively against risks and damages from storm and flood by predicting the possibility and scale of the disaster. Generally the research on numerical model based on statistical methods, the KDF model of TCDIS developed by NIDP, for analyzing and predicting disaster risks and damages has been mainstreamed. In this paper, we introduced the model for prediction of damage cost from storm and flood by the neural network algorithm which outstandingly implements the pattern recognition. Also, we compared the performance of the neural network model with that of KDF model of TCDIS. We come to the conclusion that the robustness and accuracy of prediction of damage cost on TCDIS will increase by adapting the neural network model rather than the KDF model.","PeriodicalId":122700,"journal":{"name":"The Kips Transactions:partb","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127183843","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Sentence Sentiment Classification reflecting Formal and Informal Vocabulary Information 一个反映正式和非正式词汇信息的句子情感分类
The Kips Transactions:partb Pub Date : 2011-10-31 DOI: 10.3745/KIPSTB.2011.18B.5.325
Sang-Hyun Cho, Hang-Bong Kang
{"title":"A Sentence Sentiment Classification reflecting Formal and Informal Vocabulary Information","authors":"Sang-Hyun Cho, Hang-Bong Kang","doi":"10.3745/KIPSTB.2011.18B.5.325","DOIUrl":"https://doi.org/10.3745/KIPSTB.2011.18B.5.325","url":null,"abstract":"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.","PeriodicalId":122700,"journal":{"name":"The Kips Transactions:partb","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125401000","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Red Tide Blooms Prediction using Fuzzy Reasoning 利用模糊推理预测赤潮
The Kips Transactions:partb Pub Date : 2011-10-31 DOI: 10.3745/KIPSTB.2011.18B.5.291
Sun Park, S. Lee
{"title":"Red Tide Blooms Prediction using Fuzzy Reasoning","authors":"Sun Park, S. Lee","doi":"10.3745/KIPSTB.2011.18B.5.291","DOIUrl":"https://doi.org/10.3745/KIPSTB.2011.18B.5.291","url":null,"abstract":"Red tide is a temporary natural phenomenon to change sea color by harmful algal blooms, which finfish and shellfish die en masse. There have been many studies on red tide due to increasing of harmful algae damage of fisheries in Korea. Particularly, red tide damage can be minimized by means of prediction of red tide blooms. However, the most of red tide research in Korea has been focused only classification of red tide which it is not enough for predicting red tide blooms. In this paper, we proposed the red tide blooms prediction method using fuzzy reasoning.","PeriodicalId":122700,"journal":{"name":"The Kips Transactions:partb","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130604130","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Contents Recommendation Method Based on Social Network 基于社交网络的内容推荐方法
The Kips Transactions:partb Pub Date : 2011-10-31 DOI: 10.3745/KIPSTB.2011.18B.5.279
Y. Pei, Jongsoo Sohn, In-Jeong Chung
{"title":"Contents Recommendation Method Based on Social Network","authors":"Y. Pei, Jongsoo Sohn, In-Jeong Chung","doi":"10.3745/KIPSTB.2011.18B.5.279","DOIUrl":"https://doi.org/10.3745/KIPSTB.2011.18B.5.279","url":null,"abstract":"As the volume of internet and web contents have shown an explosive growth in recent years, lately contents recommendation system (CRS) has emerged as an important issue. Consequently, researches on contents recommendation method (CRM) for CRS have been conducted consistently. However, traditional CRMs have the limitations in that they are incapable of utilizing in web 2.0 environments where positions of content creators are important. In this paper, we suggest a novel way to recommend web contents of high quality using both degree of centrality and TF-IDF. For this purpose, we analyze TF-IDF and degree of centrality after collecting RSS and FOAF. Then we recommend contents using these two analyzed values. For the verification of the suggested method, we have developed the CRS and showed the results of contents recommendation. With the suggested idea we can analyze relations between users and contents on the entered query, and can consequently provide the appropriate contents to the user. Moreover, the implemented system we suggested in this paper can provide more reliable contents than traditional CRS because the importance of the role of content creators is reflected in the new system.","PeriodicalId":122700,"journal":{"name":"The Kips Transactions:partb","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129467499","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Mobile Semantic Integrated Search System of National Defense Research Information 国防科研信息移动语义集成搜索系统
The Kips Transactions:partb Pub Date : 2011-10-31 DOI: 10.3745/KIPSTB.2011.18B.5.295
Donghee Yoo, M. Ra
{"title":"A Mobile Semantic Integrated Search System of National Defense Research Information","authors":"Donghee Yoo, M. Ra","doi":"10.3745/KIPSTB.2011.18B.5.295","DOIUrl":"https://doi.org/10.3745/KIPSTB.2011.18B.5.295","url":null,"abstract":"To effectively manage research information in the field of national defense, metadata about the information should be managed systematically, and an integrated system to help convergence and management of the information should be implemented based on the metadata. In addition, the system should provide the users with effective integrated search services in a mobile environment, because searching via the use of mobile devices is increasing. The objective of this paper is to suggest a MSISS (Mobile Semantic Integrated Search System), which satisfies the requirements for effective management of the national defense research information. Specifically, we defined national defense research ontologies and national defense research rules after analyzing the Dublin Core metadata and database information of the major military research institutions. We implemented a prototype system for MSISS to demonstrate the use of the ontologies and rules for semantic integrated searching of the military research information. We also presented a triple-based search service to support semantic integrated search in a mobile environment and suggested future mobile semantic integrated search services.","PeriodicalId":122700,"journal":{"name":"The Kips Transactions:partb","volume":"431 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126132263","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Intensity Correction of 3D Stereoscopic Images Using Binarization-Based Region Segmentation 基于二值化区域分割的三维立体图像强度校正
The Kips Transactions:partb Pub Date : 2011-10-31 DOI: 10.3745/KIPSTB.2011.18B.5.265
Sang-Hyun Kim, Jeong-Yeop Kim
{"title":"Intensity Correction of 3D Stereoscopic Images Using Binarization-Based Region Segmentation","authors":"Sang-Hyun Kim, Jeong-Yeop Kim","doi":"10.3745/KIPSTB.2011.18B.5.265","DOIUrl":"https://doi.org/10.3745/KIPSTB.2011.18B.5.265","url":null,"abstract":"In this paper, we propose a method for intensity correction using binarization-based region segmentation in 3D stereoscopic images. In the proposed method, 3D stereoscopic right image is segmented using binarizarion. Small regions in the segmented image are eliminated. For each region in right image, a corresponding region in left image is decided through region matching using correlation coefficient. When region-based matching, in order to prevent overlap between regions, we remove a portion of the area closed to the region boundary using morphological filter. The intensity correction in left and right image can be performed through histogram specification between the corresponding regions. Simulation results show the proposed method has the smallest matching error than the conventional method when we generate the right image from the left image using block based motion compensation.","PeriodicalId":122700,"journal":{"name":"The Kips Transactions:partb","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131715219","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
An improvement in FGS coding scheme for high quality scalability 一种改进的FGS编码方案,实现高质量的可扩展性
The Kips Transactions:partb Pub Date : 2011-10-31 DOI: 10.3745/KIPSTB.2011.18B.5.249
Hee-Hyung Boo, Sung-Ho Kim
{"title":"An improvement in FGS coding scheme for high quality scalability","authors":"Hee-Hyung Boo, Sung-Ho Kim","doi":"10.3745/KIPSTB.2011.18B.5.249","DOIUrl":"https://doi.org/10.3745/KIPSTB.2011.18B.5.249","url":null,"abstract":"FGS (fine granularity scalability) supporting scalability in MPEG-4 Part 2 is a scalable video coding scheme that provides bit-rate adaptation to varying network bandwidth thereby achieving of its optimal video quality. In this paper, we proposed FGS coding scheme which performs one more bit-plane coding for residue signal occured in the enhancement-layer of the basic FGS coding scheme. The experiment evaluated in terms of video quality scalability of the proposed FGS coding scheme by comparing with FGS coding scheme of the MPEG-4 verification model (VM-FGS). The comparison was conducted by analysis of PSNR values of three tested video sequences. The results showed that when using rate control algorithm VM5+, the proposed FGS coding scheme obtained Y, U, V PSNR of 0.4 dB, 9.4 dB, 9 dB averagely higher and when using fixed QP value 17, obtained Y, U, V PSNR of 4.61 dB, 20.21 dB, 16.56 dB averagely higher than the existing VM-FGS. From results, we found that the proposed FGS coding scheme has higher video quality scalability to be able to achieve video quality from minimum to maximum than VM-FGS.","PeriodicalId":122700,"journal":{"name":"The Kips Transactions:partb","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132541930","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Study on Spam Document Classification Method using Characteristics of Keyword Repetition 基于关键词重复特征的垃圾文档分类方法研究
The Kips Transactions:partb Pub Date : 2011-10-31 DOI: 10.3745/KIPSTB.2011.18B.5.315
Seong-Jin Lee, Jongbum Baik, Chungseok Han, Soowon Lee
{"title":"A Study on Spam Document Classification Method using Characteristics of Keyword Repetition","authors":"Seong-Jin Lee, Jongbum Baik, Chungseok Han, Soowon Lee","doi":"10.3745/KIPSTB.2011.18B.5.315","DOIUrl":"https://doi.org/10.3745/KIPSTB.2011.18B.5.315","url":null,"abstract":"In Web environment, a flood of spam causes serious social problems such as personal information leak, monetary loss from fishing and distribution of harmful contents. Moreover, types and techniques of spam distribution which must be controlled are varying as days go by. The learning based spam classification method using Bag-of-Words model is the most widely used method until now. However, this method is vulnerable to anti-spam avoidance techniques, which recent spams commonly have, because it classifies spam documents utilizing only keyword occurrence information from classification model training process. In this paper, we propose a spam document detection method using a characteristic of repeating words occurring in spam documents as a solution of anti-spam avoidance techniques. Recently, most spam documents have a trend of repeating key phrases that are designed to spread, and this trend can be used as a measure in classifying spam documents. In this paper, we define six variables, which represent a characteristic of word repetition, and use those variables as a feature set for constructing a classification model. The effectiveness of proposed method is evaluated by an experiment with blog posts and E-mail data. The result of experiment shows that the proposed method outperforms other approaches.","PeriodicalId":122700,"journal":{"name":"The Kips Transactions:partb","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115559553","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Forward Vehicle Detection Algorithm Using Column Detection and Bird`s-Eye View Mapping Based on Stereo Vision 基于立体视觉的柱检测和鸟瞰映射前向车辆检测算法
The Kips Transactions:partb Pub Date : 2011-10-31 DOI: 10.3745/KIPSTB.2011.18B.5.255
Chung-Hee Lee, Y. Lim, Soon Kwon, Jonghwa Kim
{"title":"Forward Vehicle Detection Algorithm Using Column Detection and Bird`s-Eye View Mapping Based on Stereo Vision","authors":"Chung-Hee Lee, Y. Lim, Soon Kwon, Jonghwa Kim","doi":"10.3745/KIPSTB.2011.18B.5.255","DOIUrl":"https://doi.org/10.3745/KIPSTB.2011.18B.5.255","url":null,"abstract":"In this paper, we propose a forward vehicle detection algorithm using column detection and bird`s-eye view mapping based on stereo vision. The algorithm can detect forward vehicles robustly in real complex traffic situations. The algorithm consists of the three steps, namely road feature-based column detection, bird`s-eye view mapping-based obstacle segmentation, obstacle area remerging and vehicle verification. First, we extract a road feature using maximum frequent values in v-disparity map. And we perform a column detection using the road feature as a new criterion. The road feature is more appropriate criterion than the median value because it is not affected by a road traffic situation, for example the changing of obstacle size or the number of obstacles. But there are still multiple obstacles in the obstacle areas. Thus, we perform a bird`s-eye view mapping-based obstacle segmentation to divide obstacle accurately. We can segment obstacle easily because a bird`s-eye view mapping can represent the position of obstacle on planar plane using depth map and camera information. Additionally, we perform obstacle area remerging processing because a segmented obstacle area may be same obstacle. Finally, we verify the obstacles whether those are vehicles or not using a depth map and gray image. We conduct experiments to prove the vehicle detection performance by applying our algorithm to real complex traffic situations.","PeriodicalId":122700,"journal":{"name":"The Kips Transactions:partb","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127000676","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信