发布求助
文献互助 智能选刊 最新文献

Journal of Computer Science and Cybernetics最新文献

筛选
英文 中文
CHOOSING SEEDS FOR SEMI-SUPERVISED GRAPH BASED CLUSTERING 基于半监督图聚类的种子选择
Journal of Computer Science and Cybernetics Pub Date : 2019-10-31 DOI: 10.15625/1813-9663/35/4/14123
C. Le, V. Vu, L. K. Oanh, Nguyen Thi Hai Yen
{"title":"CHOOSING SEEDS FOR SEMI-SUPERVISED GRAPH BASED CLUSTERING","authors":"C. Le, V. Vu, L. K. Oanh, Nguyen Thi Hai Yen","doi":"10.15625/1813-9663/35/4/14123","DOIUrl":"https://doi.org/10.15625/1813-9663/35/4/14123","url":null,"abstract":"Though clustering algorithms have long history, nowadays clustering topic still attracts a lot of attention because of the need of efficient data analysis tools in many applications such as social network, electronic commerce, GIS, etc. Recently, semi-supervised clustering, for example, semi-supervised K-Means, semi-supervised DBSCAN, semi-supervised graph-based clustering (SSGC) etc., which uses side information, has received a great deal of attention. Generally, there are two forms of side information: seed form (labeled data) and constraint form (must-link, cannot-link). By integrating information provided by the user or domain expert, the semi-supervised clustering can produce expected results. In fact, clustering results usually depend on side information provided, so different side information will produce different results of clustering. In some cases, the performance of clustering may decrease if the side information is not carefully chosen. This paper addresses the problem of efficient collection of seeds for semi-supervised clustering, especially for graph based clustering by seeding (SSGC). The properly collected seeds can boost the quality of clustering and minimize the number of queries solicited from the user. For this purpose, we have developed an active learning algorithm (called SKMMM) for the seeds collection task, which identifies candidates to solicit users by using the K-Means and min-max algorithms. Experiments conducted on real data sets from UCI and a real collected document data set show the effectiveness of our approach compared with other methods.","PeriodicalId":15444,"journal":{"name":"Journal of Computer Science and Cybernetics","volume":"94 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79450477","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
Pythagorean Picture Fuzzy Sets, Part 1- basic notions 毕达哥拉斯图象模糊集，第1部分-基本概念
Journal of Computer Science and Cybernetics Pub Date : 2019-10-31 DOI: 10.15625/1813-9663/35/4/13898
B. Cuong
{"title":"Pythagorean Picture Fuzzy Sets, Part 1- basic notions","authors":"B. Cuong","doi":"10.15625/1813-9663/35/4/13898","DOIUrl":"https://doi.org/10.15625/1813-9663/35/4/13898","url":null,"abstract":"Picture fuzzy set (2013) is a generalization of the Zadeh‟ fuzzy set (1965) and the Antanassov‟intuitionistic fuzzy set. The new concept could be useful for many computational intelligentproblems. Basic operators of the picture fuzzy logic were studied by Cuong, Ngan [10,11 ].Newconcept –Pythagorean picture fuzzy set ( PPFS) is a combination of Picture fuzzy set with theYager‟s Pythagorean fuzzy set [12-14].First, in the Part 1 of this paper, we consider basic notionson PPFS as set operators of PPFS‟s , Pythagorean picture relation, Pythagorean picture fuzzy softset. Next, the Part 2 of the paper is devoted to main operators in fuzzy logic on PPFS: picturenegation operator, picture t-norm, picture t-conorm, picture implication operators on PPFS.As aresult we will have a new branch of the picture fuzzy set theory.","PeriodicalId":15444,"journal":{"name":"Journal of Computer Science and Cybernetics","volume":"46 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81436340","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
DISTORTION-BASED HEURISTIC METHOD FOR SENSITIVE ASSOCIATION RULE HIDING 基于扭曲的敏感关联规则隐藏启发式方法
Journal of Computer Science and Cybernetics Pub Date : 2019-10-31 DOI: 10.15625/1813-9663/35/4/14131
Bac Le, L. Kieu, Dat Tran
{"title":"DISTORTION-BASED HEURISTIC METHOD FOR SENSITIVE ASSOCIATION RULE HIDING","authors":"Bac Le, L. Kieu, Dat Tran","doi":"10.15625/1813-9663/35/4/14131","DOIUrl":"https://doi.org/10.15625/1813-9663/35/4/14131","url":null,"abstract":"In the past few years, privacy issues in data mining have received considerable attention in the data mining literature. However, the problem of data security cannot simply be solved by restricting data collection or against unauthorized access, it should be dealt with by providing solutions that  not only protect sensitive information, but also not affect to the accuracy of the results in data mining and not violate the sensitive knowledge related with individual privacy or competitive advantage in businesses. Sensitive association rule hiding is an important issue in privacy preserving data mining. The aim of association rule hiding is to minimize the side effects on the sanitized database, which means to reduce the number of missing non-sensitive rules and the number of generated ghost rules. Current methods for hiding sensitive rules cause side effects and data loss. In this paper, we introduce a new distortion-based method to hide sensitive rules. This method proposes the determination of critical transactions based on the number of non-sensitive maximal frequent itemsets that contain at least one item to the consequent of the sensitive rule, they can be directly affected by the modified transactions. Using this set, the number of non-sensitive itemsets that need to be considered is reduced dramatically. We compute the smallest number of transactions for modification in advance to minimize the damage to the database. Comparative experimental results on real datasets showed that the proposed method can achieve better results than other methods with fewer side effects and data loss.","PeriodicalId":15444,"journal":{"name":"Journal of Computer Science and Cybernetics","volume":"9 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78644209","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}
引用次数: 1
Numerical solution of the problems for plates on some complex partial internal supports 若干复杂局部内支板问题的数值解
Journal of Computer Science and Cybernetics Pub Date : 2019-10-31 DOI: 10.15625/1813-9663/35/4/13648
Trương Hà Hải, Vu Vinh Quang, D. Long
{"title":"Numerical solution of the problems for plates on some complex partial internal supports","authors":"Trương Hà Hải, Vu Vinh Quang, D. Long","doi":"10.15625/1813-9663/35/4/13648","DOIUrl":"https://doi.org/10.15625/1813-9663/35/4/13648","url":null,"abstract":"In the recent works, Dang and Truong proposed an iterative method for solving some problems of plates on one, two and three line partial internal supports (LPISs), and a cross internal support. In nature they are problems with strongly mixed boundary conditions for biharmonic equation. For this reason the method combines a domain decomposition technique with the reduction of the order of the equation from four to two. In this study, the method is developed for plates on internal supports of more complex configurations. Namely, we examine the cases of symmetric rectangular and H-shape supports, where the computational domain after reducing to the first quadrant of the plate is divided into three subdomains. Also, we consider the case of asymmetric rectangular support where the computational domain needs to be divided into 9 subdomains. The problems under consideration are reduced to sequences of weak mixed boundary value problems for the Poisson equation, which are solved by difference method. The performed numerical experiments show the effectiveness of the iterative method.","PeriodicalId":15444,"journal":{"name":"Journal of Computer Science and Cybernetics","volume":"65 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88962457","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
EXTENDING RELATIONAL DATABASE MODEL FOR UNCERTAIN INFORMATION 扩展不确定信息的关系数据库模型
Journal of Computer Science and Cybernetics Pub Date : 2019-10-31 DOI: 10.15625/1813-9663/35/4/13907
Hoa Nguyen
{"title":"EXTENDING RELATIONAL DATABASE MODEL FOR UNCERTAIN INFORMATION","authors":"Hoa Nguyen","doi":"10.15625/1813-9663/35/4/13907","DOIUrl":"https://doi.org/10.15625/1813-9663/35/4/13907","url":null,"abstract":"In this paper, we propose a new probabilistic relational database model, denote by PRDB, as an extension of the classical relational database model where the uncertainty of relational attribute values and tuples are respectively represented by finite sets and probability intervals. A probabilistic interpretation of binary relations on finite sets is proposed for the computation of their probability measures. The combination strategies on probability intervals are employed to combine attribute values and compute uncertain membership degrees of tuples in a relation. The fundamental concepts of the classical relational database model are extended and generalized for PRDB. Then, the probabilistic relational algebraic operations are formally defined accordingly in PRDB. In addition, a set of the properties of the algebraic operations in this new model also are formulated and proven.","PeriodicalId":15444,"journal":{"name":"Journal of Computer Science and Cybernetics","volume":"2 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89250097","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
FUZZY COMMON SEQUENTIAL RULES MINING IN QUANTITATIVE SEQUENCE DATABASES 定量序列数据库中的模糊公共序列规则挖掘
Journal of Computer Science and Cybernetics Pub Date : 2019-08-15 DOI: 10.15625/1813-9663/35/3/13277
Thanh Do Van, Phuong Truong Duc
{"title":"FUZZY COMMON SEQUENTIAL RULES MINING IN QUANTITATIVE SEQUENCE DATABASES","authors":"Thanh Do Van, Phuong Truong Duc","doi":"10.15625/1813-9663/35/3/13277","DOIUrl":"https://doi.org/10.15625/1813-9663/35/3/13277","url":null,"abstract":"","PeriodicalId":15444,"journal":{"name":"Journal of Computer Science and Cybernetics","volume":"131 1","pages":"217-232"},"PeriodicalIF":0.0,"publicationDate":"2019-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88351737","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
SEARCH FOR ENTITIES BASED ON THE IMPLICIT SEMANTIC RELATIONS 基于隐式语义关系搜索实体
Journal of Computer Science and Cybernetics Pub Date : 2019-08-09 DOI: 10.15625/1813-9663/0/0/13210
Tran Lam Quan, V. Thang
{"title":"SEARCH FOR ENTITIES BASED ON THE IMPLICIT SEMANTIC RELATIONS","authors":"Tran Lam Quan, V. Thang","doi":"10.15625/1813-9663/0/0/13210","DOIUrl":"https://doi.org/10.15625/1813-9663/0/0/13210","url":null,"abstract":"The ability to infer undefined information/knowledge by similar inference is one of the natural abilities of human. The paper aims to study, simulate the above ability. The IRS model searches for undefined information/knowledge from an unfamiliar domain using similarities from familiar domains, through query. Because the semantic relations or similarities are not explicitly stated in the query, the IRS model is called an implicit semantic entity search model. The paper presents extracting, clustering, ranking techniques and a model of implicit relational search on Vietnamese language domain.","PeriodicalId":15444,"journal":{"name":"Journal of Computer Science and Cybernetics","volume":"28 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80904483","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 NEW APPROACH TO EXACT PATTERN MATCHING 一种精确模式匹配的新方法
Journal of Computer Science and Cybernetics Pub Date : 2019-08-05 DOI: 10.15625/1813-9663/0/0/13620
T. H. Nguyễn
{"title":"A NEW APPROACH TO EXACT PATTERN MATCHING","authors":"T. H. Nguyễn","doi":"10.15625/1813-9663/0/0/13620","DOIUrl":"https://doi.org/10.15625/1813-9663/0/0/13620","url":null,"abstract":"In this paper we introduce a exible approach to design an eective algorithm for exactpattern matching, and compare it with some of the most ecient algorithms, such as AOSO, EBOM,FJS, FSBNDM, HASHq, LBNDM, SA, BMH-SBNDM, SBNDMq, TVSBS. These results are basedon the concept of the degree of fuzziness presented by P. T. Huy et al. in 2002. Theoretical analysesand experimental results indicate that in practice our proposed algorithm is faster than the abovementioned algorithms in most of the cases of patterns and alphabets.","PeriodicalId":15444,"journal":{"name":"Journal of Computer Science and Cybernetics","volume":"25 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79188666","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
Nonlinear approximations of functions having mixed smoothness 混合平滑函数的非线性近似
Journal of Computer Science and Cybernetics Pub Date : 2019-06-03 DOI: 10.15625/1813-9663/35/2/13578
Cuong M. Nguyen
{"title":"Nonlinear approximations of functions having mixed smoothness","authors":"Cuong M. Nguyen","doi":"10.15625/1813-9663/35/2/13578","DOIUrl":"https://doi.org/10.15625/1813-9663/35/2/13578","url":null,"abstract":"For multivariate Besov-type classes $U^a_{p,theta}$ of functions having nonuniform mixed smoothness  $ainrr^d_+$, we obtain the asumptotic order of entropy numbers $epsilon_n(U^a_{p,theta},L_q)$ and non-linear widths $rho_n(U^a_{p,theta},L_q)$ defined via pseudo-dimension.  We obtain also the asymptotic order of optimal methods of adaptive sampling recovery in $L_q$-norm of functions in $U^a_{p,theta}$ by sets of a finite capacity which is measured by their cardinality or pseudo-dimension.","PeriodicalId":15444,"journal":{"name":"Journal of Computer Science and Cybernetics","volume":"30 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75503253","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
TRACKING CONTROL FOR ELECTRO-OPTICAL SYSTEM IN VIBRATION ENVIROMENT BASED ON SELF-TUNING FUZZY SLIDING MODE CONTROL 基于自整定模糊滑模控制的振动环境下光电系统跟踪控制
Journal of Computer Science and Cybernetics Pub Date : 2019-06-03 DOI: 10.15625/1813-9663/35/2/12931
Duyen Ha Thi Kim, T. Manh, C. Nhu, Viet Do Hoang, Huong Nguyen Thi Thu
{"title":"TRACKING CONTROL FOR ELECTRO-OPTICAL SYSTEM IN VIBRATION ENVIROMENT BASED ON SELF-TUNING FUZZY SLIDING MODE CONTROL","authors":"Duyen Ha Thi Kim, T. Manh, C. Nhu, Viet Do Hoang, Huong Nguyen Thi Thu","doi":"10.15625/1813-9663/35/2/12931","DOIUrl":"https://doi.org/10.15625/1813-9663/35/2/12931","url":null,"abstract":"The paper presents a new method for tracking control of EOTS (Electro-Optical Tracking System) operating in mobile environment such as ship, air plane, tank and so on. This makes the base body of the EOTS has angular motion. The control alogorithm used in this paper is adaptive fuzzy sliding mode. The overall control is built and simulated in Matlab and compared with a sliding mode controller and a conventional PID controller. The simulation result illustrated the effectiveness of the proposed controller","PeriodicalId":15444,"journal":{"name":"Journal of Computer Science and Cybernetics","volume":"191 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75616914","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
首页 上一页 下一页 尾页
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学术官方微信