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

International Joint Conference on Neural Networks

作者： Mahardhika Pratama Edwin Lughofer Meng Joo Er Wenny Rahayu Tharam Dillon Department of Computer Science and IT La Trobe University Department of knowledge-based mathematical system Johannes Kepler University School of Electrical and Electronic Engineering Nanyang Technological University

ISBN: (纸本)9781509006212

Evolving intelligent system (EIS) is a machine learning algorithm, specifically designed to deal with learning from large data streams. Although the EIS research topic has attracted various contributions over the past decade, the issue of uncertainty, temporal system dynamic, and system order are relatively unexplored by existing studies. A novel EIS, namely evolving type-2 recurrent fuzzy neural network (eT2RFNN) is proposed in this paper. eT2RFNN features a novel recurrent network architecture, possessing double local recurrent connections. It generates a generalized interval type-2 fuzzy rule, where an interval type-2 multivariate Gaussian function constructs the rule premise, and the rule consequent is crafted by the nonlinear wavelet function. eT2RFNN adopts an open structure, where it can start learning process from scratch with an empty rule base. Fuzzy rules can be automatically generated according to degree of nonlinearity data stream conveys. It can performs a rule base simplification procedure by pruning and merging inactive, outdated and overlapping rules. eT2RFNN can deal with the high dimensionality problem, where an online dimensionality reduction method is integrated in the training process. The efficacy of the eT2RFNN has been numerically validated using two real-world data streams, where it provides high predictive accuracy, while retaining low complexity.

关键词： Evolving Fuzzy Systems Fuzzy Neural Networks Type-2 Fuzzy Systems Sequential Learning Fuzzy neural networks Fuzzy rules Serial learning Sequential Learning Open Architecture Gauss equation data flow ENVIRONMENTAL IMPACT STATEMENTS Conveying rule base tree surgery

来源：评论

学校读者我要写书评

暂无评论

Spatiotemporal activation time estimation improves noninvasive localization of cardiac electrical activity

Spatiotemporal activation time estimation improves noninvasi...

引用

computers in Cardiology (CinC)

作者： Matthijs J.M. Cluitmans Jaume Coll-Font Burak Erem Dana Brooks Pietro Bonizzi Joël M.H. Karel Paul G.A. Volders Ralf L.M. Peeters Ronald L. Westra Department of Data Science and Knowledge Engineering Maastricht University Maastricht The Netherlands Department of Electrical & Computer Engineering Northeastern University Boston MA USA Boston Childrens Hospital Harvard Medical School Boston MA USA Department of Data Science and Knowledge Engineering Maastricht University The Netherlands CARIM School for Cardiovascular Diseases Maastricht University The Netherlands

ISBN: (纸本)9781509008964

Electrocardiographic imaging (ECGI) reconstructs epicardial potentials and electrograms from body-surface electrocardiograms and a torso-heart geometry. For clinical purposes, local activation and recovery times are often more useful than epicardial electrograms. However, noise and fractionation can affect estimation of activation and recovery times from reconstructed electrograms. Here, we employ a method for activation and recovery time estimation that detects the simultaneous presence of spatial and temporal features associated with a passing wavefront and evaluate this in a series of canine experiments. We show that estimation of activation times is more accurate when this spatiotemporal approach is used, however, recovery times are best determined with a temporal-only approach. Additional spatial smoothing further benefits activation and recovery time estimation in all cases. This results in a median beat origin localization error of only one centimeter, which could expedite catheter-based diagnostic evaluation and ablation in clinical settings.

关键词： Estimation Smoothing methods Spatiotemporal phenomena Electric potential Heart Imaging Electrodes

来源：评论

学校读者我要写书评

暂无评论

Discovery of research interests of authors over time using a topic model

Discovery of research interests of authors over time using a...

引用

International Conference on Big Data and Smart Computing (BIGCOMP)

作者： Young-Seob Jeong Sang-Hun Lee Gahgene Gweon Department of Computer Science KAIST Yuseong-gu Daejeon South Korea Agency for Defense Development Daejeon South Korea Department of Knowledge Service Engineering KAIST Daejeon South Korea

With a growing number of Web documents, many approaches have been proposed for knowledge discovery on Web documents. The documents do not always provide keywords or categories, so unsupervised approaches are desirable, and topic modeling is such an approach for knowledge discovery without using labels. Further, Web documents usually have time information such as publish years, so knowledge patterns over time can be captured by incorporating the time information. In this paper, we propose a new topic model called the Author Topic-Flow (ATF) model whose objective is to capture temporal patterns of research interests of authors over time, where each topic is associated with a research domain. The design of the ATF model is based on the hypothesis that direct topic flows are better than indirect topic flows in the state-of-the-art Temporal Author Topic (TAT) model, which is the most similar approach to ours. We prove the hypothesis by showing the effectiveness of the ATF model compared to the TAT model.

关键词： Semantics Electronic mail knowledge discovery Resource management Analytical models Market research

来源：评论

学校读者我要写书评

暂无评论

Bi-directional search for robust routes in time-dependent bi-criteria road networks 15

Bi-directional search for robust routes in time-dependent bi...

引用

15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2015

作者： Mihalák, Matú Montanari, Sandro Department of Knowledge Engineering Maastricht University Netherlands Department of Computer Science ETH Zurich Switzerland

ISBN: (纸本)9783939897996

Based on time-dependent travel times for N past days, we consider the computation of robust routes according to the min-max relative regret criterion. For this method we seek a path minimizing its maximum weight in any one of the N days, normalized by the weight of an optimum for the respective day. In order to speed-up this computationally demanding approach, we observe that its output belongs to the Pareto front of the network with time-dependent multi-criteria edge weights. We adapt a well-known algorithm for computing Pareto fronts in time-dependent graphs and apply the bi-directional search technique to it. We also show how to parametrize this algorithm by a value K to compute a K-approximate Pareto front. An experimental evaluation for the cases N = 2 and N = 3 indicates a considerable speed-up of the bi-directional search over the uni-directional.

关键词： Travel time

来源：评论

学校读者我要写书评

暂无评论

An efficient approach to dynamic channel assignment problem using genetic algorithm

An efficient approach to dynamic channel assignment problem ...

引用

International Conference on Microelectronics, Computing and Communications (MicroCom)

作者： Joydeep Dutta Sheuli Chakraborty Partha Sarathi Barma Samarjit Kar Computer Science NSHM Knowledge Campus Durgapur India Information Technology Asansol Engineering College Asansol India Mathematics Department National Institute of Technology Durgapur India

ISBN: (纸本)9781467366229

With the rapid enlargement in mobile communication, the bandwidth has become the most challenging resource. The total available bandwidth spectrum is divided in to some channels and that are allocated to different mobile hosts that belongs to some cells at the time of initiation of a call. So channel allocation must be done efficiently. In case of static allocation when number of mobile host increases in a particular cell, it gets overloaded. Where dynamic channel allocation minimizes the problem and increases channel utilization. But the dynamic channel allocation has to follow distributed approaches because centralized allocation is neither scalable nor reliable. In case of distributed approaches the mobile base station takes the responsibility of allocating channels to the mobile stations that correspond to the same cell. Such allocations must be made considering minimized interference between calls, while satisfying the demands for channels. We have analyzed this optimization problem by using genetic algorithm (GA). The proposed method is studied with the data of some benchmark problems, taken from the literature, and the results are obvious.

关键词： Biological cells Channel allocation Mobile communication Genetic algorithms Interference Frequency conversion Frequency modulation

来源：评论

学校读者我要写书评

暂无评论

A visualization tool for rotation-invariant boundary image matching

引用

ICIC Express Letters 2016年第2期10卷 309-315页

作者： Moon, Seongwoo Lee, Sanghun Kim, Bum-Soo Moon, Yang-Sae Department of Computer Science Kangwon National University 1 Kangwondaehak-gil Chuncheon-si Gangwon-do Korea Republic of Department of Knowledge Service Engineering Korea Advanced Institute of Science and Technology 291 Daehak-ro Yuseong-gu Daejeon Korea Republic of

In this paper, we present a visualization tool that efficiently supports rotation-invariant boundary image matching. Supporting the rotation invariance in boundary image matching is very important for the more accurate and more intuitive matching result. We use the client-server model to design and implement the rotation-invariant matching. First, the client converts a query image to a time-series and sends it to the server. Second, the server performs the rotation-invariant matching by evaluating the query on the database with indexes. Third, the client visualizes the result received from the server. Experimental results show that our system supports the rotation-invariant property efficiently and provides the intuitive analysis through line and polar charts. © 2016, ICIC Express Letters ICIC International.

关键词： Data visualization

来源：评论

学校读者我要写书评

暂无评论

Preface

引用

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2017年 10664 LNCS卷 V-X页

作者： Winands, Mark H. M. van den Herik, Jaap Kosters, Walter A. Department of Data Science and Knowledge Engineering Maastricht University MaastrichtLimburg Netherlands Leiden Centre of Data Science Leiden University LeidenZuid-Holland Netherlands Leiden Institute of Advanced Computer Science Leiden University LeidenZuid-Holland Netherlands

来源：评论

学校读者我要写书评

暂无评论

Quantifying patterns of research interest evolution

arXiv

引用

arXiv 2017年

作者： Jia, Tao Wang, Dashun Szymanski, Boleslaw K. College of Computer and Information Science Southwest University Chongqing400715 China Laboratory for Software and Knowledge Engineering Southwest University Chongqing400715 China Kellogg School of Management Northwestern University EvanstonIL60208 United States Northwestern University EvanstonIL60208 United States McCormick School of Enginnering and Applied Sciences Northwestern University EvanstonIL60208 United States Social Cognitive Networks Academic Research Center Rensselaer Polytechnic Institute TroyNY12180 United States Department of Computer Science Rensselaer Polytechnic Institute TroyNY12180 United States Spo leczna Akademia Nauk Lòdz90-113 Poland

Our quantitative understanding of how scientists choose and shift their research focus over time is highly consequential, because it affects the ways in which scientists are trained, science is funded, knowledge is organized and discovered, and excellence is recognized and rewarded [1-9]. Despite extensive investigations of various factors that influence a scientist's choice of research topics [8-21], quantitative assessments of mechanisms that give rise to macroscopic patterns characterizing research interest evolution of individual scientists remain limited. Here we perform a large-scale analy- sis of publication records, finding that research interest change follows a reproducible pattern characterized by an exponential distribution. We identify three fundamen- tal features responsible for the observed exponential distribution, which arise from a subtle interplay between exploitation and exploration in research interest evolution [5, 22]. We develop a random walk based model, allowing us to accurately reproduce the empirical observations. This work presents a quantitative analysis of macroscopic patterns governing research interest change, discovering a high degree of regularity underlying scientific research and individual careers. Copyright © 2017, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Recurring comparison faults: Sorting and finding the minimum 20th

Recurring comparison faults: Sorting and finding the minimum

引用

20th International Symposium on Fundamentals of Computation Theory, FCT 2015

作者： Geissmann, Barbara Mihalák, Matúš Widmayer, Peter Department of Computer Science ETH Zurich Zurich Switzerland Department of Knowledge Engineering Maastricht University Maastricht Netherlands

ISBN: (纸本)9783319221762

In a faulty environment, comparisons between two elements with respect to an underlying linear order can come out right or go wrong. A wrong comparison is a recurring comparison fault if comparing the same two elements yields the very same result each time we compare the elements. We examine the impact of such faults on the elementary problems of sorting a set of distinct elements and finding a minimum element in such a set. The more faults occur, the worse the approaches to solve these problems can become and we parametrize our analysis by an upper bound k on the number of faults. We first explain that reconstructing the sorted order of the elements is impossible in the presence of even one fault. Then, we focus on the maximum information content we get by performing all possible comparisons. We consider two natural approaches for sorting the elements that involve knowledge of the outcomes of all comparisons: the first approach finds a permutation (compatible solution) that contradicts at most k times the outcomes of comparisons, and the second approach sorts the elements by the number of times an element is returned to be larger in the outcomes of its comparisons with all other elements (score solution). In such permutations the elements can be dislocated from their positions in the linear order. We measure the quality of such permutations by three measures: the maximum dislocation of an element, the sum of dislocations of all elements, and the Kemeny distance compared to the linear order. We show for compatible solutions that the Kemeny distance is at most 2k, the sum of dislocations at most 4k, and the maximum dislocation at most 2k. In score solutions the Kemeny distance is smaller than 4k, the sum of dislocations smaller than 8k, and the maximum dislocation at most k +1. Our upper bounds are tight for compatible solutions, but possibly not tight for score solutions. It turns out that none of the two approaches is better than the other in all measures. For the

关键词： Problem solving

来源：评论

学校读者我要写书评

暂无评论

Preface

引用

CEUR Workshop Proceedings 2017年 1935卷

作者： Bastianelli, Emanuele D'Aquin, Mathieu Nardi, Daniele Knowledge Media Institute Open University United Kingdom Insight Centre for Data Analytics National University of Ireland Galway Ireland Department of Computer Science Control and Management Engineering Sapienza University of Rome Italy

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：