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

arXiv 2020年

作者： Basiri, Mohammad Hossein Ghojogh, Benyamin Azad, Nasser L. Fischmeister, Sebastian Karray, Fakhri Crowley, Mark The Department of Systems Design Engineering University of Waterloo ON Canada The Department of Electrical and Computer Engineering University of Waterloo ON Canada The Smart Hybrid and Electric Vehicles Systems Lab The Real-Time Embedded Software Lab The Machine Learning Lab The Centre for Pattern Analysis and Machine Intelligence

Vehicle platooning has been shown to be quite fruitful in the transportation industry to enhance fuel economy, road throughput, and driving comfort. Model Predictive Control (MPC) is widely used in literature for platoon control to achieve certain objectives, such as safely reducing the distance among consecutive vehicles while following the leader vehicle. In this paper, we propose a Distributed Nonlinear MPC (DNMPC), based upon an existing approach, to control a heterogeneous dynamic platoon with unidirectional topologies, handling possible cut-in/cut-out maneuvers. The introduced method addresses a collision-free driving experience while tracking the desired speed profile and maintaining a safe desired gap among the vehicles. The time of convergence in the dynamic platooning is derived based on the time of cut-in and/or cut-out maneuvers. In addition, we analyze the improvement level of driving comfort, fuel economy, and absolute and relative convergence of the method by using distributed metric learning and distributed optimization with Alternating Direction Method of Multipliers (ADMM). Simulation results on a dynamic platoon with cut-in and cut-out maneuvers and with different unidirectional topologies show the effectiveness of the introduced method. Copyright © 2020, The Authors. All rights reserved.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

Continual Learning in the Presence of Repetition

arXiv

引用

arXiv 2024年

作者： Hemati, Hamed Pellegrini, Lorenzo Duan, Xiaotian Zhao, Zixuan Xia, Fangfang Masana, Marc Tscheschner, Benedikt Veas, Eduardo Zheng, Yuxiang Zhao, Shiji Li, Shao-Yuan Huang, Sheng-Jun Lomonaco, Vincenzo van de Ven, Gido M. Institute for Computer Science University of St. Gallen Rosenbergstrasse 30 St. Gallen9000 Switzerland Department of Computer Science University of Bologna Via dell’Università 50 Cesena47521 Italy The University of Chicago 5801 S Ellis Ave Chicago60637 United States Argonne National Laboratory 9700 S Cass Ave Lemont60439 United States Graz University of Technology Rechbauerstraße 12 Graz8010 Austria TU Graz - SAL Dependable Embedded Systems Lab Silicon Austria Labs Graz8010 Austria Know-Center GmbH Sandgasse 36/4 Graz8010 Austria MIIT Key Laboratory of Pattern Analysis and Machine Intelligence Nanjing University of Aeronautics and Astronautics Nanjing211106 China Department of Computer Science University of Pisa Piano Secondo Largo Bruno Pontecorvo 3 Pisa56127 Italy Department of Electrical Engineering KU Leuven Kasteelpark Arenberg 10 Leuven3001 Belgium

Continual learning (CL) provides a framework for training models in ever-evolving environments. Although re-occurrence of previously seen objects or tasks is common in real-world problems, the concept of repetition in the data stream is not often considered in standard benchmarks for CL. Unlike with the rehearsal mechanism in buffer-based strategies, where sample repetition is controlled by the strategy, repetition in the data stream naturally stems from the environment. This report provides a summary of the CLVision challenge at CVPR 2023, which focused on the topic of repetition in class-incremental learning. The report initially outlines the challenge objective and then describes three solutions proposed by finalist teams that aim to effectively exploit the repetition in the stream to learn continually. The experimental results from the challenge highlight the effectiveness of ensemble-based solutions that employ multiple versions of similar modules, each trained on different but overlapping subsets of classes. This report underscores the transformative potential of taking a different perspective in CL by employing repetition in the data stream to foster innovative strategy design. © 2024, CC BY.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Why is the Winner the Best?

Why is the Winner the Best?

引用

Conference on Computer Vision and pattern Recognition (CVPR)

作者： M. Eisenmann A. Reinke V. Weru M. D. Tizabi F. Isensee T. J. Adler S. Ali V. Andrearczyk M. Aubreville U. Baid S. Bakas N. Balu S. Bano J. Bernal S. Bodenstedt A. Casella V. Cheplygina M. Daum M. De Bruijne A. Depeursinge R. Dorent J. Egger D. G. Ellis S. Engelhardt M. Ganz N. Ghatwary G. Girard P. Godau A. Gupta L. Hansen K. Harada M. Heinrich N. Heller A. Hering A. Huaulmé P. Jannin A. E. Kavur O. Kodym M. Kozubek J. Li H. Li J. Ma C. Martín-Isla B. Menze A. Noble V. Oreiller N. Padoy S. Pati K. Payette T. Rädsch J. Rafael-Patiño V. Singh Bawa S. Speidel C. H. Sudre K. Van Wijnen M. Wagner D. Wei A. Yamlahi M. H. Yap C. Yuan M. Zenk A. Zia D. Zimmerer D. Aydogan B. Bhattarai L. Bloch R. Brüngel J. Cho C. Choi Q. Dou I. Ezhov C. M. Friedrich C. Fuller R. R. Gaire A. Galdran Á. García Faura M. Grammatikopoulou S. Hong M. Jahanifar I. Jang A. Kadkhodamohammadi I. Kang F. Kofler S. Kondo H. Kuijf M. Li M. Luu T. Martinčič P. Morais M. A. Naser B. Oliveira D. Owen S. Pang J. Park S. Park S. Płotka E. Puybareau N. Rajpoot K. Ryu N. Saeed A. Shephard P. Shi D. Štepec R. Subedi G. Tochon H. R. Torres H. Urien J. L. Vilaça K. A. Wahid H. Wang J. Wang L. Wang X. Wang B. Wiestler M. Wodzinski F. Xia J. Xie Z. Xiong S. Yang Y. Yang Z. Zhao K. Maier-Hein P. F. Jäger A. Kopp-Schneider L. Maier-Hein Division of Intelligent Medical Systems German Cancer Research Center (DKFZ) Heidelberg Germany Helmholtz Imaging German Cancer Research Center (DKFZ) Heidelberg Germany Faculty of Mathematics and Computer Science Heidelberg University Heidelberg Germany Division of Biostatistics German Cancer Research Center (DKFZ) Heidelberg Germany Division of Medical Image Computing German Cancer Research Center (DKFZ) Heidelberg Germany Faculty of Engineering and Physical Sciences School of Computing University of Leeds Leeds UK Institute of Informatics School of Management HES-SO Valais-Wallis University of Applied Sciences and Arts Western Switzerland Sierre Switzerland Department of Nuclear Medicine and Molecular Imaging Lausanne University Hospital Lausanne Switzerland Technische Hochschule Ingolstadt Ingolstadt Germany Center for Artificial Intelligence and Data Science for Integrated Diagnostics (AI2D) and Center for Biomedical Image Computing and Analytics (CBICA) University of Pennsylvania Philadelphia PA USA Department of Pathology and Laboratory Medicine Perelman School of Medicine University of Pennsylvania Philadelphia PA USA Department of Radiology Perelman School of Medicine University of Pennsylvania Philadelphia PA USA Department of Radiology University of Washington Seattle WA USA Department of Computer Science Wellcome/EPSRC Centre for Interventional and Surgical Sciences (WEISS) University College London London UK Universitat Autònoma de Barcelona & Computer Vision Center Barcelona Spain Division of Translational Surgical Oncology National Center for Tumor Diseases (NCT/UCC) Dresden Dresden Germany Department of Advanced Robotics Istituto Italiano di Tecnologia Italy Department of Electronics Information and Bioengineering Politecnico di Milano Milan Italy IT University of Copenhagen Copenhagen Denmark Department of General Visceral and Transplantation Surgery Heidelberg University Hospital Heidelberg Germany Department of Radiology and Nuc

International benchmarking competitions have become fundamental for the comparative performance assessment of image analysis methods. However, little attention has been given to investigating what can be learnt from these competitions. Do they really generate scientific progress? What are common and successful participation strategies? What makes a solution superior to a competing method? To address this gap in the literature, we performed a multicenter study with all 80 competitions that were conducted in the scope of IEEE ISBI 2021 and MICCAI 2021. Statistical analyses performed based on comprehensive descriptions of the submitted algorithms linked to their rank as well as the underlying participation strategies revealed common characteristics of winning solutions. These typically include the use of multi-task learning (63%) and/or multi-stage pipelines (61%), and a focus on augmentation (100%), image preprocessing (97%), data curation (79%), and post-processing (66%). The “typical” lead of a winning team is a computer scientist with a doctoral degree, five years of experience in biomedical image analysis, and four years of experience in deep learning. Two core general development strategies stood out for highly-ranked teams: the reflection of the metrics in the method design and the focus on analyzing and handling failure cases. According to the organizers, 43% of the winning algorithms exceeded the state of the art but only 11% completely solved the respective domain problem. The insights of our study could help researchers (1) improve algorithm development strategies when approaching new problems, and (2) focus on open research questions revealed by this work.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Particle swarm clustering ensemble 08

Particle swarm clustering ensemble

引用

10th Annual Genetic and Evolutionary Computation Conference, GECCO 2008

作者： Ahmadi, Abbas Karray, Fakhri Kamel, Mohamed Pattern Analysis and Machine Intelligence Lab. Department of Systems Design Engineering University of Waterloo 200 University Avenue West Waterloo ON Canada

ISBN: (纸本)9781605581309

Extracting natural groups of the unlabeled data is known as clustering. To improve the stability and robustness of the clustering outputs, clustering ensembles have emerged recently. In this paper, an ensemble of particle swarm clustering algorithms is proposed. That is, the members of the ensemble are based on the cooperative swarms clustering approaches. The performance of the proposed particle swarm clustering ensemble is evaluated using different data sets and is compared to that of other clustering techniques.

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

A fuzzy set approach to extracting keywords from abstracts

A fuzzy set approach to extracting keywords from abstracts

引用

Conference of the North American Fuzzy Information Processing Society - NAFIPS

作者： M. Makrehchi M. Kamel Pattern Analysis and Machine Intelligence Lab Department of Systems Design Engineering University of Waterloo Waterloo ONT Canada Department of Systems Design Engineering University of Waterloo Waterloo Ontario Canada

An unsupervised keyword extraction method based on corpora is proposed. After representing each document in the collection by a fuzzy set of candidate keywords, the problem is translated into finding appropriate fuzzy membership degree for each candidate. In order to determine the membership degrees, first, all terms of the vocabulary are mapped into a two-dimensional space called class-collection map by obtaining two newly proposed fuzzy measures called fuzzy significance and fuzzy relevance for each term. At the second step, the mapped terms are grouped into three categories, namely, features, keywords and stopwords that are discriminated by their contribution to the meaning of the documents. Instead of a clustering approach for grouping purpose, a fuzzy rule base is provided. The method is independent of the language and data dimensionality. It does not require the use of dictionary, thesaurus nor natural language processing.

关键词： Fuzzy sets Vocabulary Web pages Abstracts Text mining Fuzzy systems pattern analysis machine intelligence System analysis and design design engineering

来源：评论

学校读者我要写书评

暂无评论

A reinfrocement learning approach to online learning in control

A reinfrocement learning approach to online learning in cont...

引用

Fourth International Conference on Control and Automation

作者： Tehrani, Ali M. Kamel, Mohamed S. Pattern Analysis and Machine Intelligence Lab Systems Design Engineering Department University of Waterloo Waterloo Ont. N2L 3G1 Canada

ISBN: (纸本)078037777X

In search for a reinforcement learning technique with the simplicity of tabular techniques and capability of dealing with continuous states like in fuzzy systems, we introduce a new approach, which we have called Adaptive Pseudo Fuzzy technique. The idea is to partition the state space with some window functions similar to fuzzy membership functions and learn the output values by changing the rules' consequents directly. This is a kind of local function approximation similar to RBFs and CMACs , however, unlike RBFs it does not shift the basis, and unlike CMACs it does not go through complex coarse coding. This method represents the input as a fuzzy system and learns the output as a look-up-table. We employed this technique in Sarsa(λ) to build a general online controller and examined it for a pole-balancing problem. © 2003 IEEE.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

Data dependence in combining classifiers

引用

4th International Workshop on Multiple Classifier systems, MCS 2003

作者： Kamel, Mohamed S. Wanas, Nayer M. Pattern Analysis and Machine Intelligence lab Department of Systems Design Engineering University of Waterloo WaterlooONN2L-3G1 Canada

ISBN: (纸本)3540403698

It has been accepted that multiple classifier systems provide a platform for not only performance improvement, but more efficient and robust pattern classification systems. A variety of combining methods have been proposed in the literature and some work has focused on comparing and categorizing these approaches. In this paper we present a new categorization of these combining schemes based on their dependence on the data patterns being classified. Combining methods can be totally independent from the data, or they can be implicitly or explicitly dependent on the data. It is argued that data dependent, and especially explicitly data dependent, approaches represent the highest potential for improved performance. On the basis of this categorization, an architecture for explicit data dependent combining methods is discussed. Experimental results to illustrate the comparative performance of some combining methods according to this categorization is included. © Springer-Verlag Berlin Heidelberg 2003.

关键词： Computers

来源：评论

学校读者我要写书评

暂无评论

Document classification using phrases

引用

Joint IAPR 9th International Workshop on Structural and Syntactic pattern Recognition, SSPR 2002 and 4th International Workshop on Statistical Techniques in pattern Recognition, SPR 2002

作者： Bakus, Jan Kamel, Mohamed Pattern Analysis and Machine Intelligence Lab Department of Systems Design Engineering University of Waterloo WaterlooON Canada

ISBN: (纸本)3540440119

This paper presents a Bayes document classifier using phrases as *** e phrases are extracted using a grammar that iteratively applies the rules to the sequence of words in the document. This grammar is generated from a training set using statistical word association. W e report an improvement in the classification over the "bag of words" representation. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Extraction of text phrases using hierarchical grammar 15th

Extraction of text phrases using hierarchical grammar

引用

15th Conference of the Canadian Society for Computational Studies of intelligence, AI 2002

作者： Bakus, Jan Kamel, Mohamed Carey, Tom Pattern Analysis and Machine Intelligence Lab Department of Systems Design Engineering University of Waterloo WaterlooON Canada Department of Management Sciences University of Waterloo WaterlooON Canada

ISBN: (纸本)9783540479222

This paper presents an algorithm for extraction of phrases from text *** e algorithm builds phrases by iteratively merging bigrams according to an association *** o association measures are presented: mutual information and t-test.T he extracted phrases are tested in a document classification task using a tf/idf model and a k-nearest neighbor classifier. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

A novel computational intelligence approach for multiple-point routing in communication networks

A novel computational intelligence approach for multiple-poi...

引用

IEEE International Conference on systems, Man and Cybernetics

作者： S. Al-Sharhan F. Karray W. Gueaieb Department of Systems Design Engineering University of Waterloo Ontario Canada Pattern Analysis and Machine Intelligence (PAMI) Lab Department of Systems Design Engineering University of Waterloo Waterloo ONT Canada

A new evolutionary algorithm for the constrained multiple destination routing problem is presented. The constrained multicast problem is characterized by a minimum cost multicast tree and a bounded end-to-end delay. It has been proven that this problem is NP-complete. The proposed algorithm is based on a soft computing technique that integrates in an efficient manner the merits of genetic algorithms and concepts of the competitive learning in the artificial neural networks literature. A population based learning algorithm is utilized, among other techniques, to construct a delay bounded multicast tree. A salient feature of the algorithm is the adaptive learning concept that achieves an efficient trade-off between the exploration and exploitation of the search space.

关键词： Computational intelligence Routing Communication networks Multicast algorithms Delay Evolutionary computation Costs Computer networks Genetic algorithms Artificial neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：