检索结果-内蒙古大学图书馆

IEEE Symposium Series on Computational Intelligence

作者： Alexander Dockhorn Christian Braune Rudolf Kruse Institute of Knowledge and Language Engineering Department for Computer Science Otto von Guericke University Magdeburg

ISBN: (纸本)9781479975617

DBSCAN is one of the most common density-based clustering algorithms. While multiple works tried to present an appropriate estimate for needed parameters we propose an alternating optimization algorithm, which finds a locally optimal parameter combination. The algorithm is based on the combination of two hierarchical versions of DBSCAN, which can be generated by fixing one parameter and iterating through possible values of the second parameter. Due to monotonicity of the neighborhood sets and the core-condition, successive levels of the hierarchy can efficiently be computed. An local optimal parameter combination can be determined using internal cluster validation measures. In this work we are comparing the measures edge-correlation and silhouette coefficient. For the latter we propose a density-based interpretation and show a respective computational efficient estimate to detect non-convex clusters produced by DBSCAN. Our results show, that the algorithm can automatically detect a good DBSCAN clustering on a variety of cluster scenarios.

关键词： Optimization algorithms Hierarchical one-parameter monotonicity Social Hierarchy automatic detection local optimum optimal parameter

来源：评论

学校读者我要写书评

暂无评论

Computing reachable sets of differential inclusions

Lecture Notes in Control and Information Sciences

引用

Lecture Notes in Control and Information sciences 2014年 456卷 357-365页

作者： Gonzalez, Sanja ivanovi Collins, Pieter Department of Mathematics and Computer Science Barry University NE 2nd Ave Miami ShoresFL United States Department of Knowledge Engineering Maastricht University MaastrichtLH Netherlands

来源：评论

学校读者我要写书评

暂无评论

Implicit knowledge discovery in biomedical ontologies: Computing interesting relatednesses

Implicit knowledge discovery in biomedical ontologies: Compu...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Tian Bai Leiguang Gong Casimir A. Kulikowski Lan Huang Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China College of Computer Science and Technology Jilin University Changchun China Yantai Intelligent Information Technologies Ltd. Yantai China Department of Computer Science Rutgers The State University of New Jersey Piscataway NJ USA

Ontologies, seen as effective representations for sharing and reusing knowledge, have become increasingly important in biomedicine, usually focusing on taxonomic knowledge specific to a subject. Efforts have been made to uncover implicit knowledge within large biomedical ontologies by exploring semantic similarity and relatedness between concepts. However, much less attention has been paid to another potentially helpful approach: discovering implicit knowledge across multiple ontologies of different types, such as disease ontologies, symptom ontologies, and gene ontologies. In this paper, we propose a unified approach to the problem of ontology based implicit knowledge discovery - a Multi-Ontology Relatedness Model (MORM), which includes the formation of multiple related ontologies, a relatedness network and a formal inference mechanism based on set-theoretic operations. Experiments for biomedical applications have been carried out, and preliminary results show the potential value of the proposed approach for biomedical knowledge discovery.

关键词： Biological system modeling Biomedical measurement Ontologies Arthritis Diseases

来源：评论

学校读者我要写书评

暂无评论

The RASH Framework: Enabling HTML+RDF submissions in scholarly venues

The RASH Framework: Enabling HTML+RDF submissions in scholar...

引用

ISWC 2015 Posters and Demonstrations Track, ISWC-P and D 2015 - co-located with the 14th International Semantic Web Conference, ISWC 2015

作者： Di Iorio, Angelo Nuzzolese, Andrea Giovanni Osborne, Francesco Peroni, Silvio Poggi, Francesco Smith, Michael Vitali, Fabio Zhao, Jun Department of Computer Science and Engineering University of Bologna Bologna Italy Semantic Technology Laboratory Institute of Cognitive Sciences and Technologies Italian National Research Council Rome Italy Knowledge Media Institute Open University Milton Keynes United Kingdom World Wide Web Consortium Shinjuku Tokyo Japan Graduate School of Media and Governance Keio University Fujisawa Kanagawa Japan School of Computing and Communications Lancaster University Lancaster United Kingdom

This paper introduces the RASH Framework, i.e., a set of specifications and tools for writing academic articles in RASH, a simplified version of HTML. RASH focuses strictly on writing the content of the paper leaving all the issues about its validation, visualisation, conversion, and data extraction to the tools developed within the framework.

关键词： HTML

来源：评论

学校读者我要写书评

暂无评论

Visual information search based on knowledge schema modeling 14

Visual information search based on knowledge schema modeling

引用

5th Information Interaction in Context Symposium, IIiX 2014

作者： Lee, Seulki Shah, Achal Yoon, Wan C. Department of Knowledge Service Engineering Korea Advanced Institute of Science and Technology Daejeon Korea Republic of Department of Computer Science and Engineering Indian Institute of Technology Guwahati Guwahati India

ISBN: (纸本)9781450329767

This paper suggests a new interactive system based on visualization of the user's knowledge schema to aid the process of information search and knowledge discovery. The system, inspired from the human memory model, constructs an external representation of the user's conceptual knowledge structure from the user's existing information such as the folder structure and associated tags. In contrast to existing systems based on user models, the system allows users to specify their information needs by selecting a part of their knowledge schema, understand their search results in the context of their existing knowledge organization, and store new information based on their knowledge schema. Through a preliminary evaluation, we show that the visualization of the extracted knowledge structure and the presented relevance of new information was perceived to be useful, even with a basic model of text processing. The participants were able to search for relevant information effectively and expand their information collection with consistency. © 2014 ACM.

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

Monte Carlo Tree Search in simultaneous move games with applications to Goofspiel 1

引用

Workshop on computer Games, CGW 2013 held in Conjunction with the 23rd International Conference on Artificial Intelligence, IJCAI 2013

作者： Lanctot, Marc Lisý, Viliam Winands, Mark H.M. Department of Knowledge Engineering Maastricht University Maastricht Netherlands Department of Computer Science Czech Technical University in Prague Praha Czech Republic

ISBN: (数字)9783319054285

ISBN: (纸本)9783319054278

Monte Carlo Tree Search (MCTS) has become a widely popular sampled-based search algorithm for two-player games with perfect information. When actions are chosen simultaneously, players may need to mix between their strategies. In this paper, we discuss the adaptation of MCTS to simultaneous move games. We introduce a new algorithm, Online Outcome Sampling (OOS), that approaches a Nash equilibrium strategy over time. We compare both head-to-head performance and exploitability of several MCTS variants in Goofspiel. We show that regret matching and OOS perform best and that all variants produce less exploitable strategies than UCT. © Springer International Publishing Switzerland 2014.

关键词： Monte Carlo methods

来源：评论

学校读者我要写书评

暂无评论

Towards richer rule languages with polynomial data complexity for the Semantic Web

Towards richer rule languages with polynomial data complexit...

引用

作者： Nguyen, Linh Anh Nguyen, Thi-Bich-Loc Szalas, Andrzej Division of Knowledge and System Engineering for ICT Faculty of Information Technology Ton Duc Thang University No. 19 Nguyen Huu Tho Street Tan Phong Ward District 7 Ho Chi Minh City Viet Nam Institute of Informatics University of Warsaw Banacha 2 Warsaw02-097 Poland Department of Information Technology Hue University of Sciences 77 Nguyen Hue Hue city Viet Nam Department of Computer and Information Science Linköping University LinköpingSE-581 83 Sweden

We introduce a Horn description logic called Horn-DL, which is strictly and essentially richer than Horn-RegI, Horn-SHIQ and Horn-SROIQ, while still has PTime data complexity. In comparison with Horn-SROIQ, Horn-DL additionally allows the universal role and assertions of the form irreflexives, ¬s(a, b), a∗b. More importantly, in contrast to all the well-known Horn fragments EL, DL-Lite, DLP, Horn-SHIQ, and Horn-SROIQ of description logics, Horn-DL allows a form of the concept constructor "universal restriction" to appear at the left hand side of terminological inclusion axioms. Namely, a universal restriction can be used in such places in conjunction with the corresponding existential restriction. We develop the first algorithm with PTime data complexity for checking satisfiability of Horn-DL knowledge bases. © 2015 Elsevier B.V.

关键词： Data description

来源：评论

学校读者我要写书评

暂无评论

Search in imperfect information games using online Monte Carlo counterfactual regret minimization 28

Search in imperfect information games using online Monte Car...

引用

28th AAAI Conference on Artificial Intelligence, AAAI 2014

作者： Lanctot, Marc Lis, Viliam Bowling, Michael Department of Knowledge Engineering Maastricht University Netherlands Department of Computer Science FEE Czech Technical University Prague Czech Republic Department of Computing Science University of Alberta Canada

ISBN: (纸本)9781577356653

Online search in games has always been a core interest of artif icial intel1igencc Advances made in search for perfect inform ation games (such as Chess. Checkers, Go. and Backgamm on) have led to Al capable of defeating the world's top hum an experts. Search in imperfect information games (such as Poker, Bridge, and Skat) is significantly more challengi ng due to the complexities introduced by hidden information. In this paper. we present Online Outcome Sampling (OOS). the first imperfect information search algorithm that is guara nteed to converge to an equilibrium strategy in two-player zero-sum games. We show that OOS avoids common probl ems encountered by existing search algorithms and we exp erimentally evaluate its convergence rate and practical perf ormance against benchmark strategies in Liar's Dice and a variant of Goofspiel. We show that unlike with Information Set Monte Carlo Tree Search (ISMCTS) the exploitabilily of the strategies produced by OOS decreases as the amount of search time increases. In practice. OOS performs as well as ISMCTS in head-to-head play while producing strategies with lower exploitability given the same search time. © Copyright 2014. Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Monte Carlo methods

来源：评论

学校读者我要写书评

暂无评论

Job Completion Time on a Virtualized Server with Software Rejuvenation

Job Completion Time on a Virtualized Server with Software Re...

引用

作者： Machida, Fumio Nicola, Victor F. Trivedi, Kishor S. Knowledge Discovery Research Laboratories NEC Corporation Japan Mathematics and Computer Science University of Twente Netherlands Department of Electrical and Computer Engineering Duke University United States

This article analyzes the completion time of a job running on a virtualized server subject to software aging and rejuvenation in a virtual machine monitor (VMM). A job running on the server may be interrupted by virtual machine (VM) failure, VMM failure or VMM rejuvenation. The job interruption is categorized as either preemptive-repeat (prt), in which case the interrupted job needs to restart from the beginning, or preemptive-resume (prs), in which case the job resumes execution from the point of interruption. Using a semi-Markov process (SMP) to model the server behavior, the steady-state server availability is computed and the theory developed in Kulkarni et al. [1987] is used to obtain the Laplace-Stieltjes transform (LST) of the job completion time. In the numerical experiments, we introduce four types of aging behavior of VMM. The effectiveness of VMM rejuvenation on job completion time is discussed in association with the type of interruption it causes and the VMM aging type. With our parameter settings, VMM rejuvenation with prs job interruption improves the performance of job execution regardless of the aging type, with performance degradation is taken into account. © 2014 ACM 1550-4832/2014/01-ART10 $15.00.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the 23rd Paediatric Rheumatology European Society Congress: part three Abstracts

引用

PEDIATRIC RHEUMATOLOGY 2017年第1期15卷 203-259页

作者： [Anonymous] Pediatria II Reumatologia Istituto Giannina Gaslini Genoa Italy Radiologia Istituto Giannina Gaslini Genoa Italy University of Trieste Trieste Italy Division of Rheumatology Ospedale Pediatrico Bambino Gesù IRCCS Roma Italy Institute for Maternal and Child Health - IRCCS “Burlo Garofolo” Trieste Italy Pediatric Rheumatology Uludag University Medical Faculty Bursa Turkey Department of Pediatrics Nippon Medical School Tokyo Japan Division of Physiotherapy and Rehabilitaiton Faculty of Health Sciences Istanbul University Istanbul Turkey Department of Computer Engineering Gebze Institute of Technology Kocaeli Turkey Department of Pediatric Rheumatology Medical Faculty of Cerrahpasa Istanbul University Istanbul Turkey Department of Paediatric Rheumatology and Psychology Alder Hey Children’s NHS Foundation Trust Liverpool UK Department of Women’s and Children’s Health Institute of Translational Medicine Liverpool UK UK Experimental Arthritis Treatment Centre for Children University of Liverpool Liverpool UK Rheumatology Hospital for Sick Children Toronto Canada Pediatrics University of Toronto Toronto Canada Child Evaluative Health Sciences The Hospital for Sick Children Toronto Canada Lawrence S. Bloomberg Faculty of Medicine University of Toronto Toronto Canada Psychology University of Kansas Medical Center Lawrence USA Rheumatology IWK Health Center Halifax Canada Rheumatology Alberta children’s Hospital Calgary Canada Ingram School of Nursing Mcgill University Montreal Canada Child Health Evaluative Sciences Hospital for Sick Children Toronto Canada Rheumatology Children’s Hospital of Western Ontario London Canada Rheumatology CHU Ste-Justine Montreal Canada Rheumatology Montreal Children’s Hospital Montreal Canada Pediatrics Memorial University of Newfoundland St John’s Canada Pediatrics Children’s Hospital of Eastern Ontario Ottawa Canada Research Innovation and Knowledge Translation IWK Health Center Halifax Canada Pediatrics

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：