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

2015 12th Web Information System and Application Conference (WISA)最新文献

筛选
英文 中文
Medical Ontology Learning Based on Web Resources 基于Web资源的医学本体学习
2015 12th Web Information System and Application Conference (WISA) Pub Date : 2015-09-11 DOI: 10.1109/WISA.2015.10
Jun Peng, Yaru Du, Ying Chen, Ming Zhao, Bei Pei
{"title":"Medical Ontology Learning Based on Web Resources","authors":"Jun Peng, Yaru Du, Ying Chen, Ming Zhao, Bei Pei","doi":"10.1109/WISA.2015.10","DOIUrl":"https://doi.org/10.1109/WISA.2015.10","url":null,"abstract":"In order to deal with heterogeneous knowledge in the medical field, this paper proposes a method which can learn a heavy-weighted medical ontology based on medical glossaries and Web resources. Firstly, terms and taxonomic relations are extracted based on disease and drug glossaries and a light-weighted ontology is constructed, Secondly, non-taxonomic relations are automatically learned from Web resources with linguistic patterns, and the two ontologies (disease and drug) are expanded from light-weighted level towards heavy-weighted level, At last, the disease ontology and drug ontology are integrated to create a practical medical ontology. Experiment shows that this method can integrate and expand medical terms with taxonomic and different kinds of non-taxonomic relations. Our experiments show that the performance is promising.","PeriodicalId":198938,"journal":{"name":"2015 12th Web Information System and Application Conference (WISA)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131889125","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
Research on the Semantic of Entity-Oriented U-Topk Query and Its Processing 面向实体的U-Topk查询语义及其处理研究
2015 12th Web Information System and Application Conference (WISA) Pub Date : 2015-09-11 DOI: 10.1109/WISA.2015.23
Ma Zhengbing, Zhao Zhibin, Yao Lan, Bao Yu-bin, Y. Ge
{"title":"Research on the Semantic of Entity-Oriented U-Topk Query and Its Processing","authors":"Ma Zhengbing, Zhao Zhibin, Yao Lan, Bao Yu-bin, Y. Ge","doi":"10.1109/WISA.2015.23","DOIUrl":"https://doi.org/10.1109/WISA.2015.23","url":null,"abstract":"The result of U-Topk query simply consist of k tuples, which is not satisfactory in many cases mainly for the following two reasons: firstly, the probability of result is so small that it is hard for users to accept it, secondly, it abandons the relations between the tuples and the corresponding entities, accordingly it can't completely reflect the real state of monitored entities. Aiming at shortage of tuple-oriented semantic of U-Topk query, this paper proposes an entity-oriented U-Topk query named as EoU-Topk as well as query processing algorithm. The basic idea of the algorithm is converting tuple-oriented probabilistic database into entity-oriented probabilistic database. In this process, some exclusive tuples that meet the pre-defined rules will be merged. The algorithm of EoU-Topk query has two advantage: firstly, it can greatly reduce the size of probabilistic database, secondly, it can truly reflect whole state of entities, and avoid the one sidedness of the tuple-oriented U-Topk query. Finally, the efficiency and quality of the EoU-Topk query proposed in the paper are verified by experiments using real data.","PeriodicalId":198938,"journal":{"name":"2015 12th Web Information System and Application Conference (WISA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124235091","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
Based on Entities Behavior Patterns of Heterogeneous Data Semantic Conflict Detection 基于实体行为模式的异构数据语义冲突检测
2015 12th Web Information System and Application Conference (WISA) Pub Date : 2015-09-11 DOI: 10.1109/WISA.2015.49
H. Zhang, Zhongmin Yan, Chenfei Sun, Song Wei
{"title":"Based on Entities Behavior Patterns of Heterogeneous Data Semantic Conflict Detection","authors":"H. Zhang, Zhongmin Yan, Chenfei Sun, Song Wei","doi":"10.1109/WISA.2015.49","DOIUrl":"https://doi.org/10.1109/WISA.2015.49","url":null,"abstract":"As the sources of data become more and more diversified, the importance of data conflict detection is emerging. We are committed to research a new method, through the use of behavior pattern detection of heterogeneous data semantic conflict. We find that the structured data which can represents the behavior of an entity contradict from the reality behavior of the entity which can be got from unstructured text, which is often referred to as pattern conflict. So in this paper, we convert the structured data with semantic into data-converted event. Combine them with the text event extracted from unstructured text, according to the relation between entities, get a large event graph G. Find the common conflict pattern through frequent sub-graph discovery on graph G. Then use the common conflict patterns to detect conflict data. The experiment shows that our method can detect the conflict data effectively with a high recall.","PeriodicalId":198938,"journal":{"name":"2015 12th Web Information System and Application Conference (WISA)","volume":"601 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123175625","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
A Combined Index for Mixed Structured and Unstructured Data 混合结构化和非结构化数据的组合索引
2015 12th Web Information System and Application Conference (WISA) Pub Date : 2015-09-11 DOI: 10.1109/WISA.2015.36
Chunying Zhu, Qingzhong Li, Lanju Kong, Song Wei
{"title":"A Combined Index for Mixed Structured and Unstructured Data","authors":"Chunying Zhu, Qingzhong Li, Lanju Kong, Song Wei","doi":"10.1109/WISA.2015.36","DOIUrl":"https://doi.org/10.1109/WISA.2015.36","url":null,"abstract":"In big data epoch, one of the major challenges is the large volume of mixed structured and unstructured data, which comes in heterogeneous sources. Because of different form, structured and unstructured data are often considered apart from each other. However, they may speak about the same entities of the world. If a query involve both structured data and its unstructured counterpart, it is inefficient to execute it separately. The paper presents a novel index structure tailored towards the combinations of structured and unstructured data. The combined index is a joint index over structured database and unstructured document, based on entity co-occurrences. It is also a semantic index which describes the semantic relationships between entities and their multiple resources. We store the index as RDF graphs and queries are SPARQL-like. Experiments show that the associated index can not only provide apposite information but also execute queries efficiently.","PeriodicalId":198938,"journal":{"name":"2015 12th Web Information System and Application Conference (WISA)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126723384","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
A New Method for Balancing Cloud Resource 一种新的云资源均衡方法
2015 12th Web Information System and Application Conference (WISA) Pub Date : 2015-09-11 DOI: 10.1109/WISA.2015.32
Heng Song, Junwu Zhu, Yi Jiang, Bin Li
{"title":"A New Method for Balancing Cloud Resource","authors":"Heng Song, Junwu Zhu, Yi Jiang, Bin Li","doi":"10.1109/WISA.2015.32","DOIUrl":"https://doi.org/10.1109/WISA.2015.32","url":null,"abstract":"With the rapidly growing demands for cloud resource, the task to keep it balanced with supply at all times becomes especially challenging. However, most of existing mechanisms focus on auction-based allocation of cloud resource rather than balancing the demands for cloud resource. In order to address this issue, we formulate the problem of cloud resource consumption shifting between two different time intervals, and then present a directly applicable scheme with three-tiered. Users participating in the scheme, however, are motivated to get extra rewards through shifting certain consumption quantity from high to low demand time intervals. In addition, taking into account the fact that individual shifting costs and reduction capacity vary with the different geographic areas, this scheme firstly allocates rewards to agencies in different geographic areas in the way of equilibrium. And then a strictly proper rule is proposed to reward contributors according to efficiency, which achieves the theoretical properties including equilibrium, individual rationality, and budget balance and truthfulness. At last, to verify the method given by this paper, method analysis and case study is given to illustrate the correctness and effectiveness.","PeriodicalId":198938,"journal":{"name":"2015 12th Web Information System and Application Conference (WISA)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130357630","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
Truth Finding from Multiple Data Sources by Source Confidence Estimation 基于源置信度估计的多数据源真相发现
2015 12th Web Information System and Application Conference (WISA) Pub Date : 2015-09-11 DOI: 10.1109/WISA.2015.45
Fan Zhang, Li Yu, Xiangrui Cai, Ying Zhang, Haiwei Zhang
{"title":"Truth Finding from Multiple Data Sources by Source Confidence Estimation","authors":"Fan Zhang, Li Yu, Xiangrui Cai, Ying Zhang, Haiwei Zhang","doi":"10.1109/WISA.2015.45","DOIUrl":"https://doi.org/10.1109/WISA.2015.45","url":null,"abstract":"The volume of data on the Web has been growing at a dramatic pace in recent years and people rely more and more on the Web to fulfill their information needs. Numerous different descriptions of the properties towards the same objects can be obtained from a variety of data sources. This will inevitably lead to data incompleteness, data conflicts and out-of-date information problems. These issues make truth discovery among multiple data sources non-trivial. However, most of previous works consider only one single property, or deal with different properties separately by ignoring several characteristics of the properties, which will often cause unexpected deviations. In this paper, we propose a modified method to find the most trustable source and identify the true information. Our goal is to minimize the distance between the true information and the overall observed descriptions through considering the accuracy and the coverage of all the data sources at the same time. The experiments on the real dataset demonstrate the efficacy of our method.","PeriodicalId":198938,"journal":{"name":"2015 12th Web Information System and Application Conference (WISA)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123988813","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}
引用次数: 7
Cross-Platform Instant Messaging System 跨平台即时通讯系统
2015 12th Web Information System and Application Conference (WISA) Pub Date : 2015-09-11 DOI: 10.1109/WISA.2015.75
Chengzhou Fu, Yong Tang, Chengzhe Yuan, Yuying Xu
{"title":"Cross-Platform Instant Messaging System","authors":"Chengzhou Fu, Yong Tang, Chengzhe Yuan, Yuying Xu","doi":"10.1109/WISA.2015.75","DOIUrl":"https://doi.org/10.1109/WISA.2015.75","url":null,"abstract":"Instant Messaging systems are widely used in social software, especially in the mobile Internet era. With the diversified and rapid development of mobile terminal, the systems play an important role in the mobile platform. In this paper, we introduce a kind of technology to implement the cross-platform instant messaging system, which through the HTTP protocol, XMPP protocol, TCP protocol and SSH, DWR, ExtJS and other frameworks. The implementation allows running on multi-platform include Android, iOS and web.","PeriodicalId":198938,"journal":{"name":"2015 12th Web Information System and Application Conference (WISA)","volume":"198 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123437528","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 Improvement of Fuzzy C-Means Clustering Using Adaptive Particle Swarm Optimization 基于自适应粒子群优化的模糊c均值聚类算法
2015 12th Web Information System and Application Conference (WISA) Pub Date : 2015-09-11 DOI: 10.1109/WISA.2015.67
Shouwen Chen, Zhuoming Xu, Yan Tang
{"title":"An Improvement of Fuzzy C-Means Clustering Using Adaptive Particle Swarm Optimization","authors":"Shouwen Chen, Zhuoming Xu, Yan Tang","doi":"10.1109/WISA.2015.67","DOIUrl":"https://doi.org/10.1109/WISA.2015.67","url":null,"abstract":"Fuzzy C-Means (FCM) algorithm is one of the most popular fuzzy clustering techniques. However, it is easily trapped in local optima. Particle swarm optimization (PSO) is a stochastic global optimization model, which is used in many optimization problems. In this paper, a hybrid clustering algorithm, called HAPF, based on adaptive PSO (APSO) and FCM is proposed, in order to take advantage of the merits of both APSO and FCM. In HAPF the state of swarm aggregation is divided into three situations: strong, loose, and medium, respectively representing swarm's exploitation phrase, exploration phrase, and a balance between the two phrases. In addition, the interval of population diversity measured by the variance of population fitness is partitioned into three sections. After mapping the relationship between the swarm aggregation situations and the value of population diversity, three inertia weight groups are dynamically adjusted accordingly to the real-time state of population diversity. Experimental results show that the proposed HAPF is able to escape local optima and find better optima than other seven well-known clustering algorithms.","PeriodicalId":198938,"journal":{"name":"2015 12th Web Information System and Application Conference (WISA)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130632157","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
A Collaborative Filtering Algorithm of Selecting Neighbors Based on User Profiles and Target Item 一种基于用户配置文件和目标项的邻居选择协同过滤算法
2015 12th Web Information System and Application Conference (WISA) Pub Date : 2015-09-11 DOI: 10.1109/WISA.2015.51
Yaqiong Guo, Mengxing Huang, Tao Lou
{"title":"A Collaborative Filtering Algorithm of Selecting Neighbors Based on User Profiles and Target Item","authors":"Yaqiong Guo, Mengxing Huang, Tao Lou","doi":"10.1109/WISA.2015.51","DOIUrl":"https://doi.org/10.1109/WISA.2015.51","url":null,"abstract":"Without considering the difference in user profiles and user rated items, traditional User-Based collaborative filtering recommendation algorithm only considers the users' score on the item when calculates the similarity between users. In order to get rid of disadvantages of traditional methods, this paper proposes a collaborative filtering algorithm of selecting neighbors based on user profiles and target item. Aiming at obtaining target user's neighbors more suitable, this paper uses a weighting coefficient to adjust the final similarity which is influences by user profiles' similarity and users' rating similarity. In the case of user's neighbor didn't rate the target item, the expanded neighbors are considered, finally predicting and recommending target items. The experimental results show that the algorithm improves the accuracy of similarity, and effectively alleviates the user rating data sparseness problem, while improving the accuracy of the prediction.","PeriodicalId":198938,"journal":{"name":"2015 12th Web Information System and Application Conference (WISA)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126855374","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
A Collaborative Filtering Recommendation Algorithm with Time Adjusting Based on Attribute Center of Gravity Model 基于属性重心模型的时间调整协同过滤推荐算法
2015 12th Web Information System and Application Conference (WISA) Pub Date : 2015-09-11 DOI: 10.1109/WISA.2015.54
Liangyou Gao, Mengxing Huang
{"title":"A Collaborative Filtering Recommendation Algorithm with Time Adjusting Based on Attribute Center of Gravity Model","authors":"Liangyou Gao, Mengxing Huang","doi":"10.1109/WISA.2015.54","DOIUrl":"https://doi.org/10.1109/WISA.2015.54","url":null,"abstract":"In the collaborative filtering recommendation technology, the similarity measurement part plays a vital role, and similarity measurement accuracy seriously affects the similarity measurement part and all the subsequent parts. However, there are many shortcomings in the similarity measurement part of traditional memory-based collaborative filtering recommendation technology. In order to solve the inaccuracy under special circumstances, this paper proposes an improved algorithm, a collaborative filtering recommendation algorithm with time adjusting based on attribute center of gravity model, through altering the process of similarity calculation. Simulation results show that the improved algorithm gains a higher recommendation accuracy, compared with the traditional algorithms.","PeriodicalId":198938,"journal":{"name":"2015 12th Web Information System and Application Conference (WISA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129476571","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}
引用次数: 5
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信