首页 > 最新文献

2010 Second International Conference on Knowledge and Systems Engineering最新文献

英文 中文
Predicting the Tide with Genetic Programming and Semantic-based Crossovers 用遗传规划和基于语义的交叉预测潮流
Nguyen Quang Uy, M. O’Neill, N. X. Hoai
This paper proposes an improvement of a recently proposed semantic-based crossover, Semantic Similarity-based Crossover (SSC). The new crossover, called the Most Semantic Similarity-based Crossover (MSSC), is tested with Genetic Programming (GP) on a real world problem, as in predicting the tide in Venice Lagoon, Italy. The results are compared with GP using Standard Crossover (SC) and GP using validation sets. The comparative results show that while using validation sets give only limited effect, using semantic-based crossovers, especially MSSC, remarkably improve the ability of GP to predict time series for the tested problem. Further analysis on GP code bloat helps to explain the reason behind this superiority of MSSC.
本文对最近提出的基于语义的跨界算法进行了改进,即基于语义相似度的跨界算法。这种新的跨界算法被称为基于最语义相似度的跨界算法(MSSC),它在一个现实世界的问题上用遗传编程(GP)进行了测试,比如预测意大利威尼斯泻湖的潮汐。结果与使用标准交叉(SC)的GP和使用验证集的GP进行了比较。对比结果表明,虽然使用验证集的效果有限,但使用基于语义的交叉,特别是MSSC,显著提高了GP对测试问题时间序列的预测能力。对GP代码膨胀的进一步分析有助于解释MSSC这种优势背后的原因。
{"title":"Predicting the Tide with Genetic Programming and Semantic-based Crossovers","authors":"Nguyen Quang Uy, M. O’Neill, N. X. Hoai","doi":"10.1109/KSE.2010.7","DOIUrl":"https://doi.org/10.1109/KSE.2010.7","url":null,"abstract":"This paper proposes an improvement of a recently proposed semantic-based crossover, Semantic Similarity-based Crossover (SSC). The new crossover, called the Most Semantic Similarity-based Crossover (MSSC), is tested with Genetic Programming (GP) on a real world problem, as in predicting the tide in Venice Lagoon, Italy. The results are compared with GP using Standard Crossover (SC) and GP using validation sets. The comparative results show that while using validation sets give only limited effect, using semantic-based crossovers, especially MSSC, remarkably improve the ability of GP to predict time series for the tested problem. Further analysis on GP code bloat helps to explain the reason behind this superiority of MSSC.","PeriodicalId":158823,"journal":{"name":"2010 Second International Conference on Knowledge and Systems Engineering","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129739765","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}
引用次数: 8
An Effective Method for Ontology Integration by Propagating Inconsistency 一种传播不一致性的本体集成方法
Pub Date : 2010-10-07 DOI: 10.1109/KSE.2010.36
Trong Hai Duong, Sang-Jin Cha, Geun-Sik Jo
Ontology integration is an important task which needs to be performed when several information systems share or exchange knowledge. We consider that most of previous methods of ontology integration merely involve blind or exhaustive matching among all concepts belonging to different ontologies. Therefore, semantic mismatches, logical inconsistencies and conceptual conflicts between ontologies are unavoidable. Additionally, the computational complexity increases rapidly in integrating large ontologies. This research aims at investigating an effective methodology for ontology integration, in which, a propagating inconsistency algorithm has proposed to reduce complexity and mismatching in ontology integration. A reconciled algorithm is suggested to generate a best representation from conflict concepts. In evaluation, we compare our complexity of the algorithms and accuracy of the results with previous approaches’.
本体集成是多个信息系统共享或交换知识时需要完成的一项重要任务。我们认为,以往的本体集成方法大多只涉及不同本体的所有概念之间的盲匹配或穷尽匹配。因此,本体之间的语义不匹配、逻辑不一致和概念冲突是不可避免的。此外,在集成大型本体时,计算复杂度会迅速增加。本研究旨在探索一种有效的本体集成方法,其中提出了一种传播不一致算法来降低本体集成的复杂性和不匹配问题。提出了一种从冲突概念中生成最佳表示的调和算法。在评估中,我们将算法的复杂性和结果的准确性与之前的方法进行了比较。
{"title":"An Effective Method for Ontology Integration by Propagating Inconsistency","authors":"Trong Hai Duong, Sang-Jin Cha, Geun-Sik Jo","doi":"10.1109/KSE.2010.36","DOIUrl":"https://doi.org/10.1109/KSE.2010.36","url":null,"abstract":"Ontology integration is an important task which needs to be performed when several information systems share or exchange knowledge. We consider that most of previous methods of ontology integration merely involve blind or exhaustive matching among all concepts belonging to different ontologies. Therefore, semantic mismatches, logical inconsistencies and conceptual conflicts between ontologies are unavoidable. Additionally, the computational complexity increases rapidly in integrating large ontologies. This research aims at investigating an effective methodology for ontology integration, in which, a propagating inconsistency algorithm has proposed to reduce complexity and mismatching in ontology integration. A reconciled algorithm is suggested to generate a best representation from conflict concepts. In evaluation, we compare our complexity of the algorithms and accuracy of the results with previous approaches’.","PeriodicalId":158823,"journal":{"name":"2010 Second International Conference on Knowledge and Systems Engineering","volume":"51 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114091294","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}
引用次数: 2
An Efficient Identity-Based Broadcast Signcryption Scheme 一种高效的基于身份的广播签名加密方案
Pub Date : 2010-10-07 DOI: 10.1109/KSE.2010.17
Dang Thu Hien, T. N. Tien, Truong Thi Thu Hien
It is a challenge to find out a suitable algorithm for broadcasting information securely and authentically to only target users. Many schemes based on public and symmetric key cryptography have been investigated. However, modeling an efficient scheme that provides both confidentiality and public cipher text authenticity is still an open problem. In this paper, we present an identity-based broadcast signcryption scheme with short cipher text size and public cipher text authenticity. The security of this scheme is proved under computational assumptions and in the random oracle model. Experimental results are also provided and compared with several schemes in both computation and communication cost.
如何找到一种合适的算法来保证信息安全、真实地传播给目标用户是一个挑战。许多基于公开密钥和对称密钥加密的方案已经被研究过。然而,如何建立一个既能提供机密性又能保证公开密文真实性的有效方案仍然是一个有待解决的问题。本文提出了一种基于身份的广播签名加密方案,该方案具有短密文长度和公开密文真实性。在计算假设和随机oracle模型下证明了该方案的安全性。给出了实验结果,并对几种方案进行了计算量和通信成本的比较。
{"title":"An Efficient Identity-Based Broadcast Signcryption Scheme","authors":"Dang Thu Hien, T. N. Tien, Truong Thi Thu Hien","doi":"10.1109/KSE.2010.17","DOIUrl":"https://doi.org/10.1109/KSE.2010.17","url":null,"abstract":"It is a challenge to find out a suitable algorithm for broadcasting information securely and authentically to only target users. Many schemes based on public and symmetric key cryptography have been investigated. However, modeling an efficient scheme that provides both confidentiality and public cipher text authenticity is still an open problem. In this paper, we present an identity-based broadcast signcryption scheme with short cipher text size and public cipher text authenticity. The security of this scheme is proved under computational assumptions and in the random oracle model. Experimental results are also provided and compared with several schemes in both computation and communication cost.","PeriodicalId":158823,"journal":{"name":"2010 Second International Conference on Knowledge and Systems Engineering","volume":"2674 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124910904","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
Crawl Topical Vietnamese Web Pages Using Genetic Algorithm 使用遗传算法抓取越南主题网页
Pub Date : 2010-10-07 DOI: 10.1109/KSE.2010.25
Nguyen Quoc Nhan, Vu Tuan Son, Huynh Thi Thanh Binh, Tran Duc Khanh
A focused crawler traverses the web selecting out relevant pages according to a predefined topic. While browsing the internet it is difficult to identify relevant pages and predict which links lead to high quality pages. In this paper, we propose a crawler system using genetic algorithm to improve its crawling performance. Apart from estimating the best path to follow, our system also expands its initial keywords by using genetic algorithm during the crawling process. To crawl Vietnamese web pages, we apply a hybrid word segmentation approach which consists of combining automata and part of speech tagging techniques for the Vietnamese text classifier. We experiment our algorithm on Vietnamese websites. Experimental results are reported to show the efficiency of our system.
一个集中的爬虫遍历网络,根据预定义的主题选择出相关的页面。在浏览互联网时,很难识别相关页面并预测哪些链接指向高质量页面。在本文中,我们提出了一种使用遗传算法来提高其爬行性能的爬虫系统。除了估计最佳路径外,我们的系统还在爬行过程中使用遗传算法扩展其初始关键字。为了抓取越南语网页,我们将一种混合分词方法应用于越南语文本分类器,该方法结合了自动机和词性标注技术。我们在越南网站上试验我们的算法。实验结果表明了系统的有效性。
{"title":"Crawl Topical Vietnamese Web Pages Using Genetic Algorithm","authors":"Nguyen Quoc Nhan, Vu Tuan Son, Huynh Thi Thanh Binh, Tran Duc Khanh","doi":"10.1109/KSE.2010.25","DOIUrl":"https://doi.org/10.1109/KSE.2010.25","url":null,"abstract":"A focused crawler traverses the web selecting out relevant pages according to a predefined topic. While browsing the internet it is difficult to identify relevant pages and predict which links lead to high quality pages. In this paper, we propose a crawler system using genetic algorithm to improve its crawling performance. Apart from estimating the best path to follow, our system also expands its initial keywords by using genetic algorithm during the crawling process. To crawl Vietnamese web pages, we apply a hybrid word segmentation approach which consists of combining automata and part of speech tagging techniques for the Vietnamese text classifier. We experiment our algorithm on Vietnamese websites. Experimental results are reported to show the efficiency of our system.","PeriodicalId":158823,"journal":{"name":"2010 Second International Conference on Knowledge and Systems Engineering","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128685258","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}
引用次数: 8
Integration of CAM Systems into Multi-axes Computerized Numerical Control Machines CAM系统在多轴数控机床中的集成
Pub Date : 2010-10-07 DOI: 10.1109/KSE.2010.30
C. My
A solution for integrating CAM (Computer - Aided Manufacturing) systems into multi-axis nutating table CNC (Computerized Numerical Control ) machines is presented in this paper. The strategy of the method is to build a CL data processing algorithm. Thus, the CL data in ISO format produced by every CAMs can be transformed and translated into G-codes files (Numerical Control files) for controlling CNC machines. An implementation of the integration and real tests performing on industrial 5-axis DMU 50e CNC machine at Dong Anh Mechanical Comp. are carried out to verify the research results.
本文提出了一种将CAM(计算机辅助制造)系统集成到多轴摇杆工作台数控机床中的解决方案。该方法的策略是建立一个CL数据处理算法。因此,每个cam产生的ISO格式的CL数据可以转换成g代码文件(数控文件)来控制数控机床。在东安机械公司的工业五轴DMU 50e数控机床上进行了集成实现和实际测试,验证了研究结果。
{"title":"Integration of CAM Systems into Multi-axes Computerized Numerical Control Machines","authors":"C. My","doi":"10.1109/KSE.2010.30","DOIUrl":"https://doi.org/10.1109/KSE.2010.30","url":null,"abstract":"A solution for integrating CAM (Computer - Aided Manufacturing) systems into multi-axis nutating table CNC (Computerized Numerical Control ) machines is presented in this paper. The strategy of the method is to build a CL data processing algorithm. Thus, the CL data in ISO format produced by every CAMs can be transformed and translated into G-codes files (Numerical Control files) for controlling CNC machines. An implementation of the integration and real tests performing on industrial 5-axis DMU 50e CNC machine at Dong Anh Mechanical Comp. are carried out to verify the research results.","PeriodicalId":158823,"journal":{"name":"2010 Second International Conference on Knowledge and Systems Engineering","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133033381","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}
引用次数: 24
A Semi-supervised Learning Method for Vietnamese Part-of-Speech Tagging 越南语词性标注的半监督学习方法
Pub Date : 2010-10-07 DOI: 10.1109/KSE.2010.35
Le-Minh Nguyen, Bach Ngo Xuan, C. Viet, Pham Quang Nhat Minh, Akira Shimazu
This paper presents a semi-supervised learning method for Vietnamese part of speech tagging. We take into account two powerful tagging models including Conditional Random Fields (CRFs)and the Guided Online-Learning models (GLs) as base learning models. We then propose a semi-supervised learning tagging model for both CRFs and GLs methods. The main idea is to use of a word-cluster model as an associate source for enrich the feature space of discriminate learning models for both training and decoding processes. Experimental results on Vietnamese Tree-bank data (VTB) showed that the proposed method is effective. Our best model achieved accuracy of 94.10% when tested on VTB, and 92.60% an independent test.
提出了一种半监督学习的越南语词性标注方法。我们考虑了两个强大的标记模型,包括条件随机场(CRFs)和引导在线学习模型(GLs)作为基础学习模型。然后,我们提出了一种针对CRFs和GLs方法的半监督学习标记模型。主要思想是利用词簇模型作为关联源,丰富区分学习模型在训练和解码过程中的特征空间。在越南树库数据(VTB)上的实验结果表明,该方法是有效的。我们的最佳模型在VTB上测试的准确率为94.10%,独立测试的准确率为92.60%。
{"title":"A Semi-supervised Learning Method for Vietnamese Part-of-Speech Tagging","authors":"Le-Minh Nguyen, Bach Ngo Xuan, C. Viet, Pham Quang Nhat Minh, Akira Shimazu","doi":"10.1109/KSE.2010.35","DOIUrl":"https://doi.org/10.1109/KSE.2010.35","url":null,"abstract":"This paper presents a semi-supervised learning method for Vietnamese part of speech tagging. We take into account two powerful tagging models including Conditional Random Fields (CRFs)and the Guided Online-Learning models (GLs) as base learning models. We then propose a semi-supervised learning tagging model for both CRFs and GLs methods. The main idea is to use of a word-cluster model as an associate source for enrich the feature space of discriminate learning models for both training and decoding processes. Experimental results on Vietnamese Tree-bank data (VTB) showed that the proposed method is effective. Our best model achieved accuracy of 94.10% when tested on VTB, and 92.60% an independent test.","PeriodicalId":158823,"journal":{"name":"2010 Second International Conference on Knowledge and Systems Engineering","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128583797","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}
引用次数: 8
A New Method for Splitting Clumped Cells in Red Blood Images 红细胞图像中团块细胞分裂的新方法
Pub Date : 2010-10-07 DOI: 10.1109/KSE.2010.27
Ngoc-Tung Nguyen, A. Duong, Hai-Quan Vu
Automated cell counting is a required task which helps examiners in evaluating blood smears. A problem is that clumped cells usually appear in images with various degree of overlapping. This study presents a new method for effectively splitting clumped cells using value in distance transform of image to quickly detect central point. Additionally, a boundary-covering degree of each point is applied to select the best fit points. Another way to cell size estimation based on single cell extraction is also employed. With results from average cell size, central points with their boundary-covering degree, over-lapping cells in the image can be split correctly and rapidly. The robustness and effectiveness of our method have been assessed through the comparison with more than 400 images labeled manually by experts and exhibiting various clumped cell. As the result, the F-measure generally reaches 93.5% and more than 82% clumped cells can be tolerated in the condition of non-distorted shape and well-focused images.
自动细胞计数是一项必要的任务,它有助于检查人员评估血液涂片。一个问题是,团块细胞通常出现在不同程度重叠的图像中。本文提出了一种利用图像距离变换中的值快速检测中心点的方法来有效分割团块细胞。此外,利用每个点的边界覆盖度来选择最佳拟合点。本文还采用了另一种基于单细胞提取的细胞大小估计方法。利用平均细胞大小、中心点及其边界覆盖度、图像中重叠细胞的分割结果,可以正确、快速地分割出重叠细胞。通过与400多张由专家手工标记并显示各种团块细胞的图像进行比较,评估了我们方法的鲁棒性和有效性。因此,f值一般达到93.5%,在形状不变形、图像聚焦良好的情况下,可以容忍82%以上的团块细胞。
{"title":"A New Method for Splitting Clumped Cells in Red Blood Images","authors":"Ngoc-Tung Nguyen, A. Duong, Hai-Quan Vu","doi":"10.1109/KSE.2010.27","DOIUrl":"https://doi.org/10.1109/KSE.2010.27","url":null,"abstract":"Automated cell counting is a required task which helps examiners in evaluating blood smears. A problem is that clumped cells usually appear in images with various degree of overlapping. This study presents a new method for effectively splitting clumped cells using value in distance transform of image to quickly detect central point. Additionally, a boundary-covering degree of each point is applied to select the best fit points. Another way to cell size estimation based on single cell extraction is also employed. With results from average cell size, central points with their boundary-covering degree, over-lapping cells in the image can be split correctly and rapidly. The robustness and effectiveness of our method have been assessed through the comparison with more than 400 images labeled manually by experts and exhibiting various clumped cell. As the result, the F-measure generally reaches 93.5% and more than 82% clumped cells can be tolerated in the condition of non-distorted shape and well-focused images.","PeriodicalId":158823,"journal":{"name":"2010 Second International Conference on Knowledge and Systems Engineering","volume":"158 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123413655","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}
引用次数: 13
Spam Filter Based on Dynamic Sender Policy Framework 基于动态发送者策略框架的垃圾邮件过滤
Pub Date : 2010-10-07 DOI: 10.1109/KSE.2010.11
N. Anh, T. Q. Anh, Nguyen Thang
The Sender Policy Framework (SPF) is an open standard specifying a technical method to prevent sender address forgery. This technique requires network administrators to create SPF records for their domains. A philosophic issue, which may limit the deployment of SPF, is that in order to use SPF, a network administrator needs to configure local DNS, but others, not himself, will take benefits from that configuration. Therefore, we proposed the Dynamic Sender Policy Framework (DSPF) approach, in which, the legal IP addresses of servers which send emails are collected and provided by a third-party. The database of SPF records can be updated automatically and can also be used among other email servers and email gateways. Using DSPF, clients may check the SPF records without any extra configuration of their DNS. Results showed that the system is able to filter 98% spam and 100% phishing. Collecting and updating processes of the database are described. Factors that influence database’s performance are discussed.
SPF (Sender Policy Framework)是一个开放的标准,它规定了防止发送方地址被伪造的技术方法。该技术要求网络管理员为其域创建SPF记录。一个可能限制SPF部署的哲学问题是,为了使用SPF,网络管理员需要配置本地DNS,但其他人(而不是他自己)将从该配置中受益。因此,我们提出了动态发送者策略框架(Dynamic Sender Policy Framework, DSPF)方法,其中发送邮件的服务器的合法IP地址由第三方收集和提供。SPF记录的数据库可以自动更新,也可以在其他邮件服务器和邮件网关之间使用。使用DSPF,客户端不需要对DNS进行额外的配置,就可以查看SPF记录。结果表明,该系统能够过滤98%的垃圾邮件和100%的网络钓鱼。描述了数据库的收集和更新过程。讨论了影响数据库性能的因素。
{"title":"Spam Filter Based on Dynamic Sender Policy Framework","authors":"N. Anh, T. Q. Anh, Nguyen Thang","doi":"10.1109/KSE.2010.11","DOIUrl":"https://doi.org/10.1109/KSE.2010.11","url":null,"abstract":"The Sender Policy Framework (SPF) is an open standard specifying a technical method to prevent sender address forgery. This technique requires network administrators to create SPF records for their domains. A philosophic issue, which may limit the deployment of SPF, is that in order to use SPF, a network administrator needs to configure local DNS, but others, not himself, will take benefits from that configuration. Therefore, we proposed the Dynamic Sender Policy Framework (DSPF) approach, in which, the legal IP addresses of servers which send emails are collected and provided by a third-party. The database of SPF records can be updated automatically and can also be used among other email servers and email gateways. Using DSPF, clients may check the SPF records without any extra configuration of their DNS. Results showed that the system is able to filter 98% spam and 100% phishing. Collecting and updating processes of the database are described. Factors that influence database’s performance are discussed.","PeriodicalId":158823,"journal":{"name":"2010 Second International Conference on Knowledge and Systems Engineering","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124088692","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}
引用次数: 2
Privacy Preserving Classification in Two-Dimension Distributed Data 二维分布式数据中的隐私保护分类
Pub Date : 2010-10-07 DOI: 10.1109/KSE.2010.38
Luong The Dung, H. Bao, Nguyễn Thế Bình, T. Hoang
Within the context of privacy preserving data mining, several solutions for privacy-preserving classification rules learning such as association rules mining have been proposed. Each solution was provided for horizontally or vertically distributed scenario. The aim of this work is to study privacy-preserving classification rules learning in two-dimension distributed data, which is a generalisation of both horizontally and vertically distributed data. In this paper, we develop a cryptographic solution for classification rules learning methods. The crucial step in the proposed solution is the privacy-preserving computation of frequencies of a tuple of values, which can ensure each participant's privacy without loss of accuracy. We illustrate the applicability of the method by using it to build the privacy preserving protocol for association rules mining and ID3 decision tree learning
在保护隐私数据挖掘的背景下,提出了一些保护隐私分类规则学习的解决方案,如关联规则挖掘。每种解决方案针对水平或垂直分布的场景提供。本工作的目的是研究二维分布式数据中保护隐私的分类规则学习,二维分布式数据是水平分布和垂直分布数据的概括。在本文中,我们开发了一种用于分类规则学习方法的密码学解决方案。该方案的关键步骤是对一组值的频率进行隐私保护计算,在不损失准确性的前提下保证每个参与者的隐私。通过构建用于关联规则挖掘和ID3决策树学习的隐私保护协议,说明了该方法的适用性
{"title":"Privacy Preserving Classification in Two-Dimension Distributed Data","authors":"Luong The Dung, H. Bao, Nguyễn Thế Bình, T. Hoang","doi":"10.1109/KSE.2010.38","DOIUrl":"https://doi.org/10.1109/KSE.2010.38","url":null,"abstract":"Within the context of privacy preserving data mining, several solutions for privacy-preserving classification rules learning such as association rules mining have been proposed. Each solution was provided for horizontally or vertically distributed scenario. The aim of this work is to study privacy-preserving classification rules learning in two-dimension distributed data, which is a generalisation of both horizontally and vertically distributed data. In this paper, we develop a cryptographic solution for classification rules learning methods. The crucial step in the proposed solution is the privacy-preserving computation of frequencies of a tuple of values, which can ensure each participant's privacy without loss of accuracy. We illustrate the applicability of the method by using it to build the privacy preserving protocol for association rules mining and ID3 decision tree learning","PeriodicalId":158823,"journal":{"name":"2010 Second International Conference on Knowledge and Systems Engineering","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127120490","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}
引用次数: 2
An Extension of Mazukiewicz Traces and their Applications in Specification of Real-Time Systems Mazukiewicz轨迹的扩展及其在实时系统规范中的应用
Pub Date : 2010-10-07 DOI: 10.1109/KSE.2010.39
Do Van Chieu, D. Hung
This paper proposes a method for specification of concurrency and timing constraints of real-time systems. The key idea of the proposed method is to extend the Mazurkiewicz Traces with time in order to capture the concurrency and timing constraints among the services of systems. The method is formal, effective for abstracting and supporting automated checking.
本文提出了一种实时系统并发性和时序约束的规范方法。该方法的核心思想是用时间扩展Mazurkiewicz轨迹,以捕获系统服务之间的并发性和时序约束。该方法对抽象和支持自动检查是形式化的、有效的。
{"title":"An Extension of Mazukiewicz Traces and their Applications in Specification of Real-Time Systems","authors":"Do Van Chieu, D. Hung","doi":"10.1109/KSE.2010.39","DOIUrl":"https://doi.org/10.1109/KSE.2010.39","url":null,"abstract":"This paper proposes a method for specification of concurrency and timing constraints of real-time systems. The key idea of the proposed method is to extend the Mazurkiewicz Traces with time in order to capture the concurrency and timing constraints among the services of systems. The method is formal, effective for abstracting and supporting automated checking.","PeriodicalId":158823,"journal":{"name":"2010 Second International Conference on Knowledge and Systems Engineering","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123155952","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}
引用次数: 6
期刊
2010 Second International Conference on Knowledge and Systems Engineering
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1