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

Correction to: Type 2 Diabetes with Artificial Intelligence Machine Learning: Methods and Evaluation

Archives of Computational Methods in engineering 2021年第7期28卷 5039-5039页

作者： Ismail, Leila Materwala, Huned Tayefi, Maryam Ngo, Phuong Karduck, Achim P. Intelligent Distributed Computing and Systems Research Laboratory Department of Computer Science and Software Engineering College of Information Technology United Arab Emirates University Al Ain Abu Dhabi United Arab Emirates National Water and Energy Center United Arab Emirates University Al Ain Abu Dhabi United Arab Emirates Norwegian Centre for E-Health Research Tromsø Norway Faculty of Informatics Furtwangen University Furtwangen Germany

来源：评论

学校读者我要写书评

暂无评论

Guiding Cross-lingual Entity Alignment via Adversarial Knowledge Embedding

Guiding Cross-lingual Entity Alignment via Adversarial Knowl...

引用

IEEE International Conference on Data Mining (ICDM)

作者： Xixun Lin Hong Yang Jia Wu Chuan Zhou Bin Wang Institute of Information Engineering Chinese Academy of Sciences Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Centre for Artificial Intelligence School of Software FEIT University of Technology Sydney Sydney Australia Department of Computing Macquarie University Sydney Australia Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing China Xiaomi AI Lab Beijing China

Cross-lingual Entity Alignment (CEA) aims at identifying entities with their counterparts in different language knowledge graphs. Knowledge embedding alignment plays an important role in CEA due to its advantages of easy implementation and run-time robustness. However, existing embedding alignment methods haven't considered the problem of embedding distribution alignment which refers to the alignment of spatial shapes of embedding spaces. To this end, we present a new Adversarial Knowledge Embedding framework (AKE for short) that jointly learns the representation, mapping and adversarial modules in an end-to-end manner. By reducing the discrepancy of embedding distributions, AKE can approximately preserve an isomorphism between source and target embeddings. In addition, we introduce two new orthogonality constraints into mapping to obtain the self-consistency and numerical stability of transformation. Experiments on real-world datasets demonstrate that our method significantly outperforms state-of-the-art baselines.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Flexible Keyphrase Extraction Technique for Academic Literature

引用

Procedia Computer Science 2018年 135卷 553-563页

作者： Gollam Rabby Saiful Azad “ Mufti Mahmud Kamal Z. Zamli Mohammed Mostafizur Rahman Faculty of Computer Systems & Software Engineering University Malaysia Pahang Gambang Kuantan Malaysia IBM Centre of Excellence Gambang Kuantan Malaysia Department of Computing and Technology Nottingham Trent University Nottingham United Kingdom Department of Mathematics American International University - Bangladesh (AIUB) Dhaka Bangladesh

A keyphrase extraction technique endeavors to extract quality keyphrases from a given document, which provide a high-level summary of that document. Except statistical keyphrase extraction approaches, all other approaches are either domain-dependent or require a sufficient amount of training data, which are rare at present. Therefore, in this paper, a new tree-based automatic keyphrase extraction technique is proposed, which is domain-independent and employs nominal statistical knowledge; but no train data are required. The proposed technique extracts a quality keyphrase through forming a tree from a candidate keyphrase; and later, it is expanded or shrunk or remained in the same state depending on other similar candidate keyphrases. At the end, keyphrases are extracted from the resultant trees based on a value, µ (which is the Maturity Index (MI) of a node in the tree), which enables flexibility in this process. A small µ value would yield many and/or lengthy keyphrases (greedy approach); whereas, a large µ value would yield lower and/or abbreviated keyphrases (conservative approach). Thereby, a user can extract his/her desired-level of keyphrases through tuning µ value. The effectiveness of the proposed technique is evaluated on an actual corpus, and compared with Rapid Automatic Keyphrase Extraction (RAKE) technique.

关键词： Candidate keyphrase keyphrase automatic keyphrase extraction technique tree data structure

来源：评论

学校读者我要写书评

暂无评论

On Autonomous systems: From Reflexive, Imperative and Adaptive Intelligence to Autonomous and Cognitive Intelligence

On Autonomous Systems: From Reflexive, Imperative and Adapti...

引用

IEEE International Conference on Cognitive Informatics

作者： Yingxu Wang Konstantinos N. Plataniotis Sam Kwong Henry Leung Svetlana Yanushkevich Fakhri Karray Ming Hou Newton Howard Rodolfo A. Fiorini Paolo Soda Edward Tunstel Jianmin Wang Shushma Patel International Institute of Cognitive Informatics and Cognitive Computing (ICIC) Schulich School of Engineering and Hotchkiss Brain Institute University of Calgary Canada University of Toronto Canada City University of Hong Kong Hong Kong University of Waterloo Canada Toronto Research Centre DRDC Canada Computational Neurosciences Lab University of Oxford UK Information & Bioengg. Politecnico di Milano University Italy Univ. Campus Bio-Medico of Rome Italy Autonomous and Intelligent Systems President IEEE SMC School of Software Tsinghua University China School of Engineering London South Bank University UK

ISBN: (数字)9781728114194

ISBN: (纸本)9781728104966

Autonomous systems underpinned by cognitive intelligence represent advanced forms of artificial intelligence studied in intelligence science, systems science, and computational intelligence. Traditional theories and technologies of autonomous systems put emphases on human-system interactions and humans in-the-loop. This paper explores the intelligence and system foundations of autonomous systems. It focuses on what structural and behavioral properties constitute the intelligence power of autonomous systems. It explains how system intelligence aggregates from reflexive, imperative, adaptive intelligence to autonomous and cognitive intelligence. A Hierarchical Intelligence Model (HIM) is introduced to elaborate the evolution of human and system intelligence as an inductive process. A set of properties of system autonomy is formally analyzed towards a wide range of autonomous system applications in computational intelligence and systems engineering.

关键词： Frequency modulation Electronic mail Handheld computers Cognitive systems Robots Animals

来源：评论

学校读者我要写书评

暂无评论

Quantum invariants and the graph isomorphism problem

引用

Physical Review A 2019年第5期100卷 052317-052317页

作者： P. W. Mills R. P. Rundle J. H. Samson Simon J. Devitt Todd Tilma V. M. Dwyer Mark J. Everitt Quantum Systems Engineering Research Group Department of Physics Loughborough University Leicestershire LE11 3TU United Kingdom The Wolfson School Loughborough University Loughborough Leicestershire LE11 3TU England United Kingdom Centre for Quantum Software and Information Faculty of Engineering and Information Technology University of Technology Sydney Sydney NSW 2007 Australia Turing Inc. Berkeley California 94701 USA Department of Physics College of Science Tokyo Institute of Technology H-63 2-12-1 Oookayama Meguro-ku Tokyo 152-8550 Japan Quantum Computing Unit Institute of Innovative Research Tokyo Institute of Technology S1-16 4259 Nagatsuta-cho Midori-ku Yokohama 226-8503 Japan

Three graph invariants are introduced which may be measured from a quantum graph state and form examples of a framework under which other graph invariants can be constructed. Each invariant is based on distinguishing a different number of qubits. This is done by applying different measurements to the qubits to be distinguished. The performance of these invariants is evaluated and compared to classical invariants. We verify that the invariants can distinguish all nonisomorphic graphs with nine or fewer nodes. The invariants have also been applied to “classically hard” strongly regular graphs, successfully distinguishing all strongly regular graphs of up to 29 nodes, and preliminarily to weighted graphs. We have found that, although it is possible to prepare states with a polynomial number of operations, the average number of preparations required to distinguish nonisomorphic graph states scales exponentially with the number of nodes. We have so far been unable to find operators which reliably compare graphs and reduce the required number of preparations to feasible levels.

关键词： Quantum algorithms Graph theory Phase space methods

来源：评论

学校读者我要写书评

暂无评论

Artificial Intelligence Powered MOOCs: A Brief Survey

Artificial Intelligence Powered MOOCs: A Brief Survey

引用

IEEE International Conference on Agents (ICA)

作者： Simon Fauvel Han Yu Chunyan Miao Lizhen Cui Hengjie Song Liang Zhang Xiaoming Li Cyril Leung Joint NTU-UBC Research Centre of Excellence in Active Living for the Elderly (LILY) Nanyang Technological University Singapore School of Computer Science and Engineering Nanyang Technological University Singapore School of Software Engineering Shandong University Jinan China School of Software Engineering South China University of Technology Guangzhou China Institute of Network Computing and Information Systems Peking University Beijing China Department of Electrical and Computer Engineering University of British Columbia Vancouver Canada

Massive Open Online Courses (MOOCs) have gained tremendous popularity in the last few years. Thanks to MOOCs, millions of learners from all over the world have taken thousands of high-quality courses for free. Artificial intelligence (AI) has played an important role in making MOOCs what they are today. By exploiting the vast amount of data generated by learners engaging in MOOCs, AI techniques have been proposed to improve our understanding of MOOC participants and enable MOOC practitioners to deliver better courses. These approaches have also greatly improved student experience and learning outcomes through constructing intelligent and personalized learning trajectories. In this paper, we first review the state-of-the-art AI research making an impact on MOOCs education, emphasizing on works which aim to enhance our understanding of student learning behaviours, improve student engagement, and improve learning outcomes. We then offer an overview of important future research to carry out in sub-fields of AI to enable MOOCs to reach their full potential.

关键词： Videos Artificial intelligence Tools Navigation Computational modeling Trajectory Education

来源：评论

学校读者我要写书评

暂无评论

A Direct Proof of Improved Biased Random Walk with Gastric Cancer Dataset

A Direct Proof of Improved Biased Random Walk with Gastric C...

引用

International Conference on Applied Mathematics & Computer Science

作者： Choon Sen Seah Shahreen Kasim Mohd Farhan Md Fudzee Mohd Saberi Mohamad Rd Rohmat Saedudin Deden Witarsyah Rohayanti Hassan Mohd Arfian Ismail Rodziah Atan Soft Computing and Data Mining Centre Faculty of Computer Sciences and Information Technology Universiti Tun Hussein Onn Malaysia Faculty of Creative Technology and Heritage Universiti Malaysia Kelantan School of Industrial Engineering Telkom University Laboratory of Biodiversity and Bioinformatics Universiti Teknologi Malaysia Faculty of Computer Systems and Software Engineering Universiti Malaysia Pahang Department of Software Engineering & Information System Faculty of Computer Science and Information Technology University Putra Malaysia (UPM)

ISBN: (数字)9781728132587

ISBN: (纸本)9781728132594

The relationship between the weight of a single genes and the connection between the genes had been studied. Chemistry and physical sciences have proved the attraction between molecules. Molecules are attracted to each other by bond. This paper is presented to disclose the relationship between weight and connectivity of nodes with biased random walk. An equation of biased random walk which named as significant directed random walk is formed to enhance the connectivity of nodes in directed graph via weigh. To be completely biased to the random walk, references data is implement as directed graph. Weight of genes will be used as one of the parameter in the formula. While the adjacency matrix is further enhanced by Warshall's algorithm to increases the accessibility of nodes via vector. The evolution of random walk is disclosed in this paper as well. Significant directed random walk will be used to prove the importance of weight in this paper. Comparison of the result between biased random walk is presented to prove the enhancement of random walk.

关键词： Biased random walk Cancer classification Gene expression dataset Random walk cancer classification Biased Ganglia one-parameter Mentoring Physical science

来源：评论

学校读者我要写书评

暂无评论

Physical origins of ruled surfaces on the reduced density matrices geometry

引用

Science China(Physics,Mechanics & Astronomy) 2017年第2期60卷 1-8页

作者： Ji-Yao Chen Zhengfeng Ji Zheng-Xin Liu Xiaofei Qi Nengkun Yu Bei Zeng Duanlu Zhou State Key Laboratory of Low Dimensional Quantum Physics Department of Physics Tsinghua University Beijing 100084 China Perimeter Institute for Theoretical Physics Waterloo N2L 2Y5 Canada Centre for Quantum Computation ＆ Intelligent Systems School of Software Faculty of Engineering and Information Technology University of Technology Sydney Sydney 2007 Australia State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing 100190 China Department of Physics Renmin University of China Beijing 100872 China Department of Mathematics Shanxi University Taiyuan 030000 China Institute for Quantum Computing University of Waterloo Waterloo N2L 3G1 Canada Department of Mathematics ＆ Statistics University of Guelph Guelph N1G 2W1 Canada Institute of Physics Chinese Academy of Sciences Beijing 100190 China

The reduced density matrices （RDMs） of many-body quantum states form a convex set. The boundary of low dimensional projections of this convex set may exhibit nontrivial geometry such as ruled surfaces. In this paper, we study the physical origins of these ruled surfaces for bosonic systems. The emergence of ruled surfaces was recently proposed as signatures of symmetry- breaking phase. We show that, apart from being signatures of symmetry-brealdng, ruled surfaces can also be the consequence of gapless quantum systems by demonstrating an explicit example in terms of a two-mode Ising model. Our analysis was largely simplified by the quantum de Finetti＇s theorem--in the limit of large system size, these RDMs are the convex set of all the symmetric separable states. To distinguish ruled surfaces originated from gapless systems from those caused by symmetry- breaking, we propose to use the finite size scaling method for the corresponding geometry. This method is then applied to the two-mode XY model, successfully identifying a ruled surface as the consequence of gapless systems.

关键词： ruled surfaces reduced density matrices bosonic system geometry

来源：评论

学校读者我要写书评

暂无评论

Joint product numerical range and geometry of reduced density matrices

引用

Science China(Physics,Mechanics & Astronomy) 2017年第2期60卷 9-17页

作者： Jianxin Chen Cheng Guo Zhengfeng Ji Yiu-Tung Poon Nengkun YU Bei Zeng Jie Zhou Joint Center for Quantum Information and Computer Science University of Maryland College Park 20740 USA Institute for Advanced Study Tsinghua University Beijing 100084 China Centre for Quantum Computation ＆ Intelligent Systems School of Software Faculty of Engineering and Information Technology University of Technology Sydney Sydney 2007 Australia State Key Laboratory of Computer Science.Institute of Software Chinese Academy of Sciences Beijing 100084 China Department of Mathematics Iowa State University Ames 50011-2140 USA Institute for Quantum Computing University of Waterloo Waterloo N2L 3G1 Canada Department of Mathematics ＆ Statistics University of Guelph Guelph N1G 2 W1 Canada Perimeter Institute for Theoretical Physics Waterloo N2L 2Y5 Canada

The reduced density matrices of a many-body quantum system form a convex set, whose three-dimensional projection is convex in R3. The boundary of may exhibit nontrivial geometry, in particular ruled surfaces. Two physical mechanisms are known for the origins of ruled surfaces： symmetry breaking and gapless. In this work, we study the emergence of ruled surfaces for systems with local Hamiltonians in infinite spatial dimension, where the reduced density matrices are known to be separable as a consequence of the quantum de Finetti＇s theorem. This allows us to identify the reduced density matrix geometry with joint product numerical range II of the Hamiltonian interaction terms. We focus on the case where the interaction terms have certain structures, such that a ruled surface emerges naturally when taking a convex hull of ∏. We show that, a ruled surface on sitting in ∏ has a gapless origin, otherwise it has a symmetry breaking origin. As an example, we demonstrate that a famous ruled surface, known as the oloid, is a possible shape of , with two boundary pieces of symmetry breaking origin separated by two gapless lines.

关键词： reduced density matrices quantum tomography numerical range quantum information oloid ruled surface

来源：评论

学校读者我要写书评

暂无评论

Improving Learning Algorithm Performance for Spiking Neural Networks

Improving Learning Algorithm Performance for Spiking Neural ...

引用

2017 17th IEEE International Conference on Communication Technology (ICCT 2017)

作者： Qiang Fu Yuling Luo Junxiu Liu Jinjie Bi Senhui Qiu Yi Cao Xuemei Ding Guangxi Key Lab of Multi-Source Information Mining & Security Faculty of Electronic Engineering Guangxi Normal University Guangxi Experiment Centre of Information Science Department of Business Transformation and Sustainable Enterprise Surrey Business SchoolUniversity of Surrey Faculty of Software Fujian Normal University School of Computing and Intelligent Systems Faculty of Computing and Engineering Ulster University

This paper proposes three methods to improve the learning algorithm for spiking neural networks（SNNs）. The aim is to improve learning performance in SNNs where neurons are allowed to fire multiple times. The performance is analyzed based on the convergence rate, the concussion condition in the training period and the error between actual output and desired output. The exclusive-or（XOR） and Wisconsin breast cancer（WBC） classification tasks are employed to validate the proposed optimized methods. Experimental results demonstrate that compared to original learning algorithm, all three methods have less iterations, higher accuracy, and more stable in the training period.

关键词： spiking neural network optimization method learning performance

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：