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

作者： 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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Pathological Brain Detection Based on Online Sequential Extreme Learning Machine

Pathological Brain Detection Based on Online Sequential Extr...

引用

2016 IEEE International Conference on Progress in Informatics and Computing

作者： Siyuan Lu Hainan Wang Xueyan Wu Shuihua Wang School of Computer Science and Technology Nanjing Normal University State Key Lab of CAD & CG Zhejiang University Key laboratory of symbolic computation and knowledge engineering of ministry of education Jilin University Key Laboratory of Statistical information technology and data mining State Statistics Bureau Department of Electrical Engineering The City College of New YorkCUNY

Magnetic resonance imaging(MRI) is a kind of imaging modality, which offers clearer images of soft tissues than computed tomography(CT). It is especially suitable for brain disease detection. It is beneficial to detect diseases automatically and accurately. We proposed a pathological brain detection method based on brain MR images and online sequential extreme learning machine. First, seven wavelet entropies(WE) were extracted from each brain MR image to form the feature vector. Then, an online sequential extreme learning machine(OS-ELM) was trained to differentiate pathological brains from the healthy *** experiment results over 132 brain MRIs showed that the proposed approach achieved a sensitivity of 93.51%, a specificity of 92.22%, and an overall accuracy of 93.33%,which suggested that our method is effective.

关键词： magnetic resonance imaging wavelet entropy online sequential extreme learning machine Classification pattern recognition

来源：评论

学校读者我要写书评

暂无评论

Pathological brain detection based on online sequential extreme learning machine

Pathological brain detection based on online sequential extr...

引用

IEEE International Conference on Progress in Informatics and Computing (PIC)

作者： Siyuan Lu Hainan Wang Xueyan Wu Shuihua Wang School of Computer Science and Technology Nanjing Normal University Nanjing Jiangsu China State Key Lab of CAD & CG Zhejiang University Hangzhou Zhejiang China Key laboratory of symbolic computation and knowledge engineering of ministry of education Jilin University Changchun Jilin China Key Laboratory of Statistical information technology and data mining State Statistics Bureau Chengdu Sichuan China Department of Electrical Engineering CUNY New York NY USA

ISBN: (纸本)9781509034857

Magnetic resonance imaging (MRI) is a kind of imaging modality, which offers clearer images of soft tissues than computed tomography (CT). It is especially suitable for brain disease detection. It is beneficial to detect diseases automatically and accurately. We proposed a pathological brain detection method based on brain MR images and online sequential extreme learning machine. First, seven wavelet entropies (WE) were extracted from each brain MR image to form the feature vector. Then, an online sequential extreme learning machine (OS-ELM) was trained to differentiate pathological brains from the healthy controls. The experiment results over 132 brain MRIs showed that the proposed approach achieved a sensitivity of 93.51%, a specificity of 92.22%, and an overall accuracy of 93.33%, which suggested that our method is effective.

关键词： Entropy Discrete wavelet transforms Feature extraction Pathology Training Magnetic resonance imaging Diseases

来源：评论

学校读者我要写书评

暂无评论

Simulation, comparison and analysis of Wireless Sensor Networks protocols: LEACH, LEACH-C, LEACH-1R, and HEED

Simulation, comparison and analysis of Wireless Sensor Netwo...

引用

International Conference on Electrical engineering (ICEE)

作者： Mohammed Omari Soumia Laroui Department of Computer Science and Engineering Shahid Beheshti University Tehran Iran Knowledge and Data Engineering Group Trinity College Dublin LDDI Laboratory Computer Science Department University of Colonel Ahmed Draya Adrar 01000 Algeria

Wireless Sensor Networks (WSNs) are made up of tiny sensor nodes which sense the data and communicate to the base station via other nodes. These sensor nodes are inexpensive portable devices with limited processing power and energy resources which make them in need of smart clustering protocols. Many clustering and routing protocols were proposed in the literature to serve large networks of such tiny devices. In this paper, we have implemented and analyzed different clustering protocols, namely LEACH, LEACH-C, LEACH-1R, and HEED using MATLAB environment. These clustering protocols are compared in different terms such as residual energy, data delivery to the base station, maximum number of rounds and the number of live nodes. Experimental results showed a better performance of the LEACH protocols when compared to the different versions of HEED. Moreover, LEACH-1R proved to be efficient in terms of network lifetime.

关键词： Wireless sensor networks Base stations Mathematical model Energy consumption Batteries Routing protocols

来源：评论

学校读者我要写书评

暂无评论

Market Value of Innovation: An Empirical Analysis on China's Stock Market

引用

Procedia Computer science 2015年 55卷 1275-1284页

作者： Meng Xiangying Zhang Yueyan Wei Xianhua School of Management University of Chinese Academy Sciences Beijing 100190 China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Science The State Key Laboratory of Automotive Safety and Energy Tsinghua University Department of Automotive Engineering Tsinghua University Beijing 100084 China

Studies on market value of innovation investment have been based on US and European database. However, few re-searchers investigate Chinese stock market about the market value of firm's expected R&D performance. In this paper, we use constructed panel dataset from three representative stock markets in China: Main Board Market, Small and Media-sized Enterprise Board Market and Growth Enterprise Market and then use intangible assets increment as innovation indicator to examine the innovation investment-firm performance association in both manufacturing and service industries by a dataset over an 11-year period covering 1455 firms to evaluate the differences in their relative contribution to market performance. By comparing the results of these three stock markets, we find out the effect of R&D investment and increasing R&D input to market value is insignificant in all three stock markets, resulting from the weak protection for minority investors and loose regulation of information disclosure. Different constructions of intangible assets of listed firms on MBM and GEM account for market's relatively low efficiency to reflect real value of R&D investment. On industry-level, we conclude that R&D investment in both service and manufacturing sector contributes positively to market performance of firms and R&D investment in service industry shows stronger and more significant linkage to market value than manufacturing industry.

关键词： Market value Innovation R&D China's stock market

来源：评论

学校读者我要写书评

暂无评论

The linked data mining challenge 2014 results and experiences 3

The linked data mining challenge 2014 results and experience...

引用

3rd International Workshop on knowledge Discovery and data Mining Meets Linked Open data, Know@LOD 2014, Co-located with 11th Extended Semantic Web Conference, ESWC 2014

作者： Svátek, Vojtěch Mynarz, Jindřich Paulheim, Heiko University of Economics Department of Information and Knowledge Engineering Prague Czech Republic University of Mannheim Germany Research Group Data and Web Science Germany

The 2014 edition of the Linked data Mining Challenge, conducted in conjunction with Know@LOD 2014, has been the third edition of this challenge. The underlying data came from two domains: public procurement, and researcher collaboration. Like in the previous year, when the challenge was held at the data Mining on Linked data workshop co-located with the European Conference on Machine Learning and Principles and Practice of knowledge Discovery in databases (ECML PKDD 2013), the response to the challenge appeared lower than expected, with only one solution submitted for the predictive task this year. We have tried to track the reasons for the continuously low participation in the challenge via a questionnaire survey, and principles have been distilled that could help organizers of future similar challenges.

关键词： Linked data

来源：评论

学校读者我要写书评

暂无评论

A fast noise resilient anomaly detection using GMM-based collective labelling

A fast noise resilient anomaly detection using GMM-based col...

引用

science and Information Conference (SAI)

作者： Elnaz Bigdeli Bijan Raahemi Mahdi Mohammadi Stan Matwin School of Electrical Engineering and Computer Science University of Ottawa Ottawa ON Canada Telfer School of Management Knowledge Discovery and Data Mining lab University of Ottawa E. Ottawa ON Canada Department of Computing Dalhousie University Halifax NB Canada Polish Academy of Sciences Warsaw Poland

Anomaly detection algorithms face several challenges including computational complexity and resiliency to noise in input data. In this paper, we propose a fast and noise-resilient cluster-based anomaly detection method using collective labelling approach. In the proposed Collective Probabilistic Anomaly Detection method, first instead of labelling each new sample (as normal or anomaly) individually, the new samples are clustered, then labelled. This collective labelling mitigates the negative impact of noise by relying on group behaviour rather than individual characteristics of incoming samples. Second, since grouping and labelling new samples may be time-consuming, we summarize clusters using Gaussian Mixture Model (GMM). Not only does GMM offer faster processing speed; it also facilitates summarizing clusters with arbitrary shape, and consequently, reducing the memory space requirement. Finally, a modified distance measure, based on Kullback-Liebner method, is proposed to calculate the similarity among clusters represented by GMMs. We evaluate the proposed method on various datasets by measuring its false alarm rate, detection rate and memory requirement. We also add different levels of noise to the input datasets to demonstrate the performance of the proposed collective anomaly detection method in the presence of noise. The experimental results confirm superior performance of the proposed method compared to individually-based labelling techniques in terms of memory usage, detection rate and false alarm rate.

关键词： Noise Shape Training Gaussian mixture model Clustering algorithms Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Automatic collection of the parallel corpus with little prior knowledge

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in Computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2014年 8801卷 95-106页

作者： Ma, Shutian Zhang, Chengzhi Department of Information Management Nanjing University of Science and Technology Nanjing210094 China Jiangsu Key Laboratory of Data Engineering and Knowledge Service Nanjing University Nanjing210093 China

As an important resource for machine translation and cross-language information retrieval, collecting large-scale parallel corpus has been paid wide attention. With the development of the Internet, researchers begin to mine the parallel corpora from the multilingual websites. They use some prior knowledge like ad hoc heuristics or calculate the similarity of the webpages structure and content to find the bilingual webpages. This paper presents a method that uses the search engine and little prior knowledge about the URL patterns to get the bilingual websites from the Internet. The method is fast for its low time cost and there is no need for large-scale computation on URL pattern matching. We have collected 88 915 candidate parallel Chinese-English webpages, which average accuracy is around 90.8%. During the evaluation, the true bilingual websites that we found have high similar html structure and good quality translations. © Springer International Publishing Switzerland 2014.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Ontology engineering in the era of linked data

引用

Bulletin of the Association for Information science and Technology 2015年第4期41卷

作者： Oscar Corcho Associate professor María Poveda-Villalón Ph.D. student Asunción Gómez-Pérez Full professor Universidad Politécnica de Madrid (UPM) and co-founder of the spin-off Localidata. His main research interests focus on linked data ontology-based data integration ontological engineering and semantic e-Science. Ontology Engineering Group (UPM). Her research activities focus on ontological engineering knowledge representation and the Semantic Web. UPM director of the artificial intelligence department and director of the Ontology Engineering Group. Her main research interests are ontologies semantic technologies linked data and the Semantic Web.

EDITOR'S SUMMARY Ontology engineering encompasses the method, tools and techniques used to develop ontologies. Without requiring ontologies, linked data is driving a paradigm shift, bringing benefits and drawbacks to the publishing world. Ontologies may be heavyweight, supporting deep understanding of a domain, or lightweight, suited to simple classification of concepts and more adaptable for linked data. They also vary in domain specificity, usability and reusabilty. Hybrid vocabularies drawing elements from diverse sources often suffer from internally incompatible semantics. To serve linked data purposes, ontology engineering teams require a range of skills in philosophy, computer science, web development, librarianship and domain expertise.

关键词： ontologies linked data index language construction information reuse logic professional competencies

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：