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

作者： Nguyen, Dang Nguyen, Loan T.T. Vo, Bay Pedrycz, Witold Division of Data Science Ton Duc Thang University Ho Chi Minh City Viet Nam Division of Knowledge and System Engineering for ICT Ton Duc Thang University Ho Chi Minh City Viet Nam Faculty of Information Technology Ton Duc Thang University Ho Chi Minh City Viet Nam Faculty of Information Technology Ho Chi Minh City University of Technology Viet Nam College of Electronics and Information Engineering Sejong University Seoul Korea Republic of Department of Electrical and Computer Engineering University of Alberta EdmontonABT6R 2V4 Canada Department of Electrical and Computer Engineering Faculty of Engineering King Abdulaziz University Jeddah21589 Saudi Arabia Systems Research Institute Polish Academy of Sciences Warsaw Poland

Mining class association rules (CARs) with the itemset constraint is concerned with the discovery of rules, which contain a set of specific items in the rule antecedent and a class label in the rule consequent. This task is commonly encountered in mining medical data. For example, when classifying which section of the population is at high risk for the HIV infection, epidemiologists often concentrate on rules which include demographic information such as gender, age, and marital status in the rule antecedent, and HIV-Positive in the rule consequent. There are two naive strategies to solve this problem, namely pre-processing and post-processing. The post-processing methods have to generate and consider a huge number of candidate CARs while the performance of the pre-processing methods depend on the number of records filtered out. Therefore, such approaches are time consuming. This study proposes an efficient method for mining CARs with the itemset constraint based on a lattice structure and the difference between two sets of object identifiers (diffset). Firstly, a lattice structure is built to store all frequent itemsets in the dataset. To reduce memory usage, instead of the entire set of object identifiers, the diffset is used. Secondly, the lattice is traversed to generate only rules which satisfy the itemset constraint. The experimental results show that the proposed algorithm outperforms existing methods in terms of both the mining time and memory usage. © 2016 Elsevier B.V. All rights reserved.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Data Acquisition system with Low-Accuracy Sensors

Data Acquisition System with Low-Accuracy Sensors

引用

International Conference on Development and Application systems

作者： Su JUN Oleksiy Roshchupkin Volodymyr KOCHAN Anatoliy SACHENKO Nataliia ROSHCHUPKINA School of Computer Science Hubei University of Technology Wuhan China Faculty of Electrical Engineering Czech Technical University Prague Czech Republic Research Institute of Intelligent Computer Systems Ternopil National Economic University Ternopil Ukraine Department of Computer Science and Econometrics Silesian University of Technology Gliwice Poland Computer System and Network Department Chernivtsi National University Chernivtsi Ukraine

ISBN: (纸本)9781509019946

The paper deals with improving the accuracy of the sensors under influence of non-informative factors. There are described the generalized block diagram of the data acquisition system and its measurement channels which provide the sensors signal processing. The generalized block diagram of the calculation process is proposed, and the structure of used neural networks is shown. Both scheme and algorithm of data processing are described. The measurement error of the proposed system was evaluated. It confirmed that proposed system adds the error of 0.32% which is very small in comparison with the etalon mean of 1%. The proposed system allows use of the sensors with a significant influence of non-informative factors.

关键词： Multisensor Sensor Neural Network Individual Transfer Function Data Acquisition system Measuring Channels Algorithm

来源：评论

学校读者我要写书评

暂无评论

A Reduced Reachability Tree for a Class of Unbounded Petri Nets

引用

IEEE/CAA Journal of Automatica Sinica 2015年第4期2卷 345-352页

作者： Shouguang Wang Mengdi Gan Mengchu Zhou Dan You School of Information and Electronic Engineering Zhejiang Gongshang University State Key Laboratory for Manufacturing Systems Engineering Xi’an Jiaotong University Ministry of Education(MoE)Key Laboratory of Embedded System and Service Computing Tongji University MoE Key Laboratory of Embedded System and Service Computing Tongji University Department of Electrical and Computer Engineering New Jersey Institute of Technology

As a powerful analysis tool of Petri nets, reachability trees are fundamental for systematically investigating many characteristics such as boundedness, liveness and reversibility. This work proposes a method to generate a reachability tree, called ωRT for short, for a class of unbounded generalized nets called ω-independent nets based on new modified reachability trees (NMRTs). ωRT can effectively decrease the number of nodes by removing duplicate and ω-duplicate nodes in the tree, and verify properties such as reachability, liveness and deadlocks. Two examples are provided to show its superiority over NMRTs in terms of tree size. © 2014 Chinese Association of Automation.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

Link prediction of LOD by multiple label propagation algorithm considering semantic distance

Link prediction of LOD by multiple label propagation algorit...

引用

IEEE Global Conference on Consumer Electronics (GCCE)

作者： Toshitaka Maki Kazuki Takahashi Akihiro Yamaguchi Toshihiko Wakahara Toru Kobayashi Akihisa Kodate Noboru Sonehara Intelligent Information System Engineering Fukuoka Institute of Technology FIT Fukuoka Japan Communication & Information Networking Fukuoka Institute of Technology FIT Fukuoka Japan Information and Systems Engineering Fukuoka Institute of Technology FIT Fukuoka Japan Computer and Information Sciences Program Nagasaki University Nagasaki Univ. Nagasaki Japan Department of Computer Science Tsuda College Tsuda Tokyo Japan Information and Society Research Division National Institute of Informatics NII Tokyo Japan

ISBN: (纸本)9781509023349

This paper presents link prediction of Linked Open Data (LOD) by Multiple Label Propagation Algorithm (MLPA). The current LOD do not have enough links. Therefore, the LOD have not been able to exert so much semantic characteristics. In order to solve this problem, we proposed the MLPA considering semantic distance. The MLPA can expand potential links of each data contained in the LOD. The experimental result of the MLPA shows the good performance and the validity of this algorithm is confirmed.

关键词： Prediction algorithms Semantics Metadata Algorithm design and analysis Conferences Consumer electronics Resource description framework

来源：评论

学校读者我要写书评

暂无评论

Enterotypes in the landscape of gut microbial community composition (vol 3, pg 8, 2017)

引用

NATURE MICROBIOLOGY 2018年第3期3卷 388-388页

作者： Costea, Paul I. Hildebrand, Falk Arumugam, Manimozhiyan Backhed, Fredrik Blaser, Martin J. Bushman, Frederic D. de Vos, Willem M. Ehrlich, S. Dusko Fraser, Claire M. Hattori, Masahira Huttenhower, Curtis Jeffery, Ian B. Knights, Dan Lewis, James D. Ley, Ruth E. Ochman, Howard O'Toole, Paul W. Quince, Christopher Relman, David A. Shanahan, Fergus Sunagawa, Shinichi Wang, Jun Weinstock, George M. Wu, Gary D. Zeller, Georg Zhao, Liping Raes, Jeroen Knight, Rob Bork, Peer European Molecular Biology Laboratory Heidelberg Germany. VIB Center for Microbiology VIB Belgium. Laboratory of Microbiology Vrije Universiteit Brussel Brussels Belgium. The Novo Nordisk Foundation Center for Basic Metabolic Research Faculty of Health and Medical Sciences University of Copenhagen Copenhagen Denmark. Wallenberg Laboratory Department of Molecular and Clinical Medicine Institute of Medicine Sahlgrenska Academy University of Gothenburg Gothenburg Sweden. Novo Nordisk Foundation Center for Basic Metabolic Research Section for Metabolic Receptology and Enteroendocrinology Faculty of Health Sciences University of Copenhagen Copenhagen Denmark. New York University Langone Medical Center New York NY USA. Department of Microbiology Perelman School of Medicine at the University of Pennsylvania Philadelphia PA USA. RPU Immunobiology Department of Bacteriology & Immunology University of Helsinki Helsinki Finland. Laboratory of Microbiology Wageningen University Wageningen The Netherlands. Metagenopolis Institut National de la Recherche Agronomique Jouy en Josas France. King's College London Centre for Host-Microbiome Interactions Dental Institute Central Office Guy's Hospital London UK. Institute for Genome Sciences at the University of Maryland School of Medicine Baltimore MD USA. Graduate School of Advanced Science and Engineering Waseda University Tokyo Japan. Department of Biostatistics Harvard School of Public Health Boston MA USA. APC Microbiome Institute University College Cork Cork Ireland. Biotechnology Institute University of Minnesota Saint Paul MN USA. Department of Computer Science and Engineering University of Minnesota Minneapolis MN USA. Center for Clinical Epidemiology and Biostatistics Perelman School of Medicine University of Pennsylvania Philadelphia PA USA. MPI Department of Microbiome Science Tübingen Germany. Department of Integrative Biology University of Texas Austin TX USA. Warwick Medical School University

Population stratification is a useful approach for a better understanding of complex biological problems in human health and wellbeing. The proposal that such stratification applies to the human gut microbiome, in the form of distinct community composition types termed enterotypes, has been met with both excitement and controversy. In view of accumulated data and re-analyses since the original work, we revisit the concept of enterotypes, discuss different methods of dividing up the landscape of possible microbiome configurations, and put these concepts into functional, ecological and medical contexts. As enterotypes are of use in describing the gut microbial community landscape and may become relevant in clinical practice, we aim to reconcile differing views and encourage a balanced application of the concept.

关键词： Community composition landscapes

来源：评论

学校读者我要写书评

暂无评论

26th Annual Computational Neuroscience Meeting (CNS*2017): Part 3 Antwerp, Belgium. 15-20 July 2017 Abstracts

引用

BMC NEUROSCIENCE 2017年第SUPPL 1期18卷 95-176页

作者： [Anonymous] Department of Neuroscience Yale University New Haven CT 06520 USA Department Physiology & Pharmacology SUNY Downstate Brooklyn NY 11203 USA NYU School of Engineering 6 MetroTech Center Brooklyn NY 11201 USA Departament de Matemàtica Aplicada Universitat Politècnica de Catalunya Barcelona 08028 Spain Institut de Neurobiologie de la Méditerrannée (INMED) INSERM UMR901 Aix-Marseille Univ Marseille France Center of Neural Science New York University New York NY USA Aix-Marseille Univ INSERM INS Inst Neurosci Syst Marseille France Laboratoire de Physique Théorique et Modélisation CNRS UMR 8089 Université de Cergy-Pontoise 95300 Cergy-Pontoise Cedex France Department of Mathematics and Computer Science ENSAT Abdelmalek Essaadi’s University Tangier Morocco Laboratory of Natural Computation Department of Information and Electrical Engineering and Applied Mathematics University of Salerno 84084 Fisciano SA Italy Department of Medicine University of Salerno 84083 Lancusi SA Italy Dipartimento di Fisica Università degli Studi Aldo Moro Bari and INFN Sezione Di Bari Italy Data Analysis Department Ghent University Ghent Belgium Coma Science Group University of Liège Liège Belgium Cruces Hospital and Ikerbasque Research Center Bilbao Spain BIOtech Department of Industrial Engineering University of Trento and IRCS-PAT FBK 38010 Trento Italy Department of Data Analysis Ghent University Ghent 9000 Belgium The Wellcome Trust Centre for Neuroimaging University College London London WC1N 3BG UK Department of Electronic Engineering NED University of Engineering and Technology Karachi Pakistan Blue Brain Project École Polytechnique Fédérale de Lausanne Lausanne Switzerland Departement of Mathematics Swansea University Swansea Wales UK Laboratory for Topology and Neuroscience at the Brain Mind Institute École polytechnique fédérale de Lausanne Lausanne Switzerland Institute of Mathematics University of Aberdeen Aberdeen Scotland UK Department of Integrativ

来源：评论

学校读者我要写书评

暂无评论

A spaceborne WAS-GMTI mode based on azimuth multi-channels

A spaceborne WAS-GMTI mode based on azimuth multi-channels

引用

IET International Radar Conference 2015

作者： Zheng, Shichao Niu, Jianwei Wang, Hui Han, Xiaolei State Key Laboratory of Virtual Reality Technology and Systems School of Computer Science and Engineering Beihang University Beijing China Institute of Electronics Chinese Academy of Sciences Beijing China Beijing Institute of Spacecraft System Engineering Beijing China

ISBN: (纸本)9781849199940

In this paper, the spaceborne wide-area surveillance ground moving target indication (WAS-GMTI) mode is proposed. In the proposed mode, the requirement of detecting targets from different aspect angles with a high revisit rate can be achieved by modifying the TOPS mode which steers antenna in the azimuth direction. And a three-channel system is chosen to achieve fine GMTI performance. With the three-channel system, the detection of moving targets is realized by displaced phase center antenna (DPCA) technique and the motion parameter is estimated using the interferometric phase. The feasibility of the proposed mode as well as the performance of GMTI is validated by theoretical analysis and simulation experiments.

关键词： Synthetic aperture radar

来源：评论

学校读者我要写书评

暂无评论

Can electric devices be identified from their signatures of waveform? 12

Can electric devices be identified from their signatures of ...

引用

2015 12th Annual IEEE Consumer Communications and Networking Conference, CCNC 2015

作者： Kushiro, Noriyuki Ide, Taichi Tomonaga, Kazuki Ogawa, Yuki Higuma, Toshiyasu Faculty of Computer Science and System Engineering Kyushu Institute of Technology KIT Iizuka Fukuoka Japan Living Environment Systems Laboratory Mitsubishi Electric Corp. Kamakura Kanagawa Japan

ISBN: (纸本)9781479963904

Life event sensor is an activity recognition sensor both for measuring electric power consumption and for detecting usage of electronic devices by utilizing a high frequency current waveform as a signature of each device. To discuss the feasibility of the sensor, we have constructed a long-term field data collection system and installed the system in five occupied houses. Discussion about feasibility of the life event sensor on long-term field data and experimental data on a test bed, which can simulate several conditions of power line, is described in this paper. © 2015 IEEE.

关键词： Information management

来源：评论

学校读者我要写书评

暂无评论

Forwarding mechanism using prioritized forwarders for opportunistic routing

Forwarding mechanism using prioritized forwarders for opport...

引用

Asia-Pacific Network Operations and Management Symposium (APNOMS)

作者： Taku Yamazaki Ryo Yamamoto Takumi Miyoshi Takuya Asaka Yoshiaki Tanaka Department of Communications and Computer Engineering Waseda University Shinjuku-ku Tokyo Japan Global Information and Telecommunication Institute Waseda University Shinjuku-ku Tokyo Japan Graduate School of Informatics and Engineering The University of Electro-Communications Chofu-shi Tokyo Japan College of Systems Engineering and Science Shibaura Institute of Technology Saitama-shi Saitama Japan Faculty of System Design Tokyo Metropolitan University Hino-shi Tokyo Japan Waseda Daigaku Shinjuku-ku Tokyo JP

ISBN: (纸本)9781467390576

In ad hoc networks, backoff-based OR (opportunistic routing) protocols, which autonomously selects a forwarder among the potential forwarders based on a random backoff time, have been proposed. However, each potential forwarder must wait for the backoff time to avoid packet collisions among receivers. In addition, the terminal density strongly affects the performance since the backoff-based OR protocols improve the performance by using multiple terminals. In this paper, we propose a novel OR protocol called PRIOR (prioritized forwarding for opportunistic routing). In PRIOR, a terminal called prioritized forwarder, which forwards packets without using a backoff time, is selected among neighbours. In addition, we propose a hop-by-hop retransmission control that performs the retransmission terminal selection on the basis of a neighbour relation with the PFs. Moreover, we introduce an explicit acknowledgement mechanism on the basis of the difference of hop counts to alleviate the bad effect of the retransmission control in dense environments. Finally, we evaluate PRIOR in comparison with conventional backoff-based OR protocols in computer simulation.

关键词： Receivers Routing Ad hoc networks Routing protocols Maintenance engineering Wireless communication

来源：评论

学校读者我要写书评

暂无评论

DIAS: A disassemble-assemble framework for highly sparse text clustering

DIAS: A disassemble-assemble framework for highly sparse tex...

引用

SIAM International Conference on Data Mining 2015, SDM 2015

作者： Liu, Hongfu Wu, Junjie Tao, Dacheng Zhang, Yuchao Fu, Yun Department of Electrical and Computer Engineering College of Engineering College of Computer and Information Science Northeastern University Boston United States School of Economics and Management Beihang University Beijing China Centre for Quantum Computation and Intelligent Systems Faculty of Engineering and Information Technology University of Technology Sydney 235 Jones Street UltimoNSW2007 Australia Beijing Institute of System Engineering Beijing China

ISBN: (纸本)9781510811522

Upon extensive studies, text clustering remains a critical challenge in data mining community. Even by various techniques proposed to overcome some of these challenges, there still exist problems when dealing with weakly related or even noisy features. In response to this, we propose a Dlssemble-ASsemble (DIAS) framework for text clustering. DIAS employs simple random feature sampling to disassemble high-dimensional text data and gains diverse structural knowledge. This also does good to avoiding the bulk of noisy features. Then the multi-view knowledge is assembled by weighted Information-theoretic Consensus Clustering (IC-C) in order to gain a high-quality consensus partitioning. Extensive experiments on eight real-world text data sets demonstrate the advantages of DIAS over other widely used methods. In particular, DIAS shows strengths in learning from very weak basic partitionings. In addition, it is the natural suitability to distributed computing that makes DIAS become a promising candidate for big text clustering. Copyright © SIAM.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：