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

Multiple independent subspace clusterings

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Wang, Xing Wang, Jun Domeniconi, Carlotta Yu, Guoxian Xiao, Guoqiang Guo, Maozu College of Computer and Information Sciences Southwest University Chongqing China Department of Computer Science George Mason University FairfaxVA United States Hubei Key Laboratory of Intelligent Geo-Information Processing China University of Geosciences Hubei China School of Electrical and Information Engineering Beijing University Of Civil Engineering and Architecture Beijing China

Multiple clustering aims at discovering diverse ways of organizing data into clusters. Despite the progress made, it's still a challenge for users to analyze and understand the distinctive structure of each output clustering. To ease this process, we consider diverse clusterings embedded in different subspaces, and analyze the embedding subspaces to shed light into the structure of each clustering. To this end, we provide a two-stage approach called MISC (Multiple Independent Subspace Clusterings). In the first stage, MISC uses independent subspace analysis to seek multiple and statistical independent (i.e. non-redundant) subspaces, and determines the number of subspaces via the minimum description length principle. In the second stage, to account for the intrinsic geometric structure of samples embedded in each subspace, MISC performs graph regularized semi-nonnegative matrix factorization to explore clusters. It additionally integrates the kernel trick into matrix factorization to handle non-linearly separable clusters. Experimental results on synthetic datasets show that MISC can find different interesting clusterings from the sought independent subspaces, and it also outperforms other related and competitive approaches on real-world datasets. Copyright © 2019, The Authors. All rights reserved.

关键词： Clustering algorithms

Ranking-based deep cross-modal hashing

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Liu, Xuanwu Yu, Guoxian Domeniconi, Carlotta Wang, Jun Ren, Yazhou Guo, Maozu College of Computer and Information Sciences Southwest University Chongqing China Hubei Key Laboratory of Intelligent Geo-Information Processing China University of Geosciences Wuhan China Department of Computer Science George Mason University Fairfax United States SMILE Lab School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu China School of Electrical and Information Engineering Beijing University of Civil Engineering and Architecture Beijing China

Cross-modal hashing has been receiving increasing interests for its low storage cost and fast query speed in multi-modal data retrievals. However, most existing hashing methods are based on hand-crafted or raw level features of objects, which may not be optimally compatible with the coding process. Besides, these hashing methods are mainly designed to handle simple pairwise similarity. The complex multilevel ranking semantic structure of instances associated with multiple labels has not been well explored yet. In this paper, we propose a ranking-based deep cross-modal hashing approach (RDCMH). RDCMH firstly uses the feature and label information of data to derive a semi-supervised semantic ranking list. Next, to expand the semantic representation power of hand-crafted features, RDCMH integrates the semantic ranking information into deep cross-modal hashing and jointly optimizes the compatible parameters of deep feature representations and of hashing functions. Experiments on real multi-modal datasets show that RDCMH outperforms other competitive baselines and achieves the state-of-the-art performance in cross-modal retrieval applications. Copyright © 2019, The Authors. All rights reserved.

关键词： Semantics

Machine learning dynamical phase transitions in complex networks

学校读者我要写书评

暂无评论

Physical Review E 2019年第5期100卷 052312-052312页

作者： Qi Ni Ming Tang Ying Liu Ying-Cheng Lai School of Information Science and Technology East China Normal University Shanghai 200241 China School of Mathematical Sciences Shanghai Key Laboratory of PMMP East China Normal University Shanghai 200241 China Shanghai Key Laboratory of Multidimensional Information Processing East China Normal University Shanghai 200241 China School of Computer Science Southwest Petroleum University Chengdu 610500 China Big Data Research Center University of Electronic Science and Technology of China Chengdu 610054 China School of Electrical Computer and Energy Engineering Arizona State University Tempe Arizona 85287 USA

Recent years have witnessed a growing interest in using machine learning to predict and identify critical dynamical phase transitions in physical systems (e.g., many-body quantum systems). The underlying lattice structures in these applications are generally regular. While machine learning has been adopted to complex networks, most existing works concern about the structural properties. To use machine learning to detect phase transitions and accurately identify the critical transition points associated with dynamical processes on complex networks thus stands out as an open and significant problem. Here we develop a framework combining supervised and unsupervised learning, incorporating proper sampling of training data set. In particular, using epidemic spreading dynamics on complex networks as a paradigmatic setting, we start from supervised learning alone and identify situations that degrade the performance. To overcome the difficulties leads to the idea of exploiting confusion scheme, effectively a combination of supervised and unsupervised learning. We demonstrate that the scheme performs well for identifying phase transitions associated with spreading dynamics on homogeneous networks, but the performance deteriorates for heterogeneous networks. To strive to meet this challenge leads to the realization that sampling the training data set is necessary for heterogeneous networks, and we test two sampling methods: one based on the hub nodes together with their neighbors and another based on k-core of the network. The end result is a general comprehensive machine learning framework for detecting phase transition and accurately identifying the critical transition point, which is robust, computationally efficient, and universally applicable to complex networks of arbitrary size and topology. Extensive tests using synthetic and empirical networks verify the virtues of the articulated framework, opening the door to exploiting machine learning for understanding, detection

关键词： Collective behavior in networks Complex systems Network phase transitions Spreading Artificial neural networks Homogeneous networks Real world networks Scale free & inhomogeneous networks Centrality Monte Carlo methods Network Models SIS model

Granular Computing: An Augmented Scheme of Degranulation Through a Modified Partition Matrix

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Xu, Kaijie Pedrycz, Witold Li, Zhiwu Xing, Mengdao School of Electro-Mechanical Engineering Xidian University Xi’an710071 China Department of remote sensing science and technology School of Electronic Engineering Xidian University Xi’an710071 China Department of Electrical and Computer Engineering University of Alberta EdmontonABT6R 2V4 Canada Systems Research Institute Polish Academy of Sciences Warsaw Poland Faculty of Engineering King Abdulaziz University Jeddah21589 Saudi Arabia Institute of Systems Engineering Macau University of Science and Technology Macau999078 China National Laboratory of Radar Signal Processing Xidian University Xi’an710071 China Collaborative Innovation Center of Information Sensing and Understanding Xidian University Xi’an710071 China National Key Laboratory of Microwave Imaging Technology Institute of Electronics Chinese Academy of Sciences Beijing100190 China

As an important technology in artificial intelligence Granular Computing (GrC) has emerged as a new multi-disciplinary paradigm and received much attention in recent years. Information granules forming an abstract and efficient characterization of large volumes of numeric data have been considered as the fundamental constructs of GrC. By generating centroids (prototypes) and partition matrix, fuzzy clustering is a commonly encountered way of information granulation. As a reverse process of granulation, degranulation involves data reconstruction completed on a basis of the granular representatives (decoding information granules into numeric data). Previous studies have shown that there is a relationship between the reconstruction error and the performance of the granulation process. Typically, the lower the degranulation error is, the better performance of granulation process becomes. However, the existing methods of degranulation usually cannot restore the original numeric data, which is one of the important reasons behind the occurrence of the reconstruction error. To enhance the quality of reconstruction (degranulation), in this study, we develop an augmented scheme through modifying the partition matrix. By proposing the augmented scheme, we dwell on a novel collection of granulation-degranulation mechanisms. In the constructed approach, the prototypes can be expressed as the product of the dataset matrix and the partition matrix. Then, in the degranulation process, the reconstructed numeric data can be decomposed into the product of the partition matrix and the matrix of prototypes. Both the granulation and degranulation are regarded as generalized rotation between the data subspace and the prototype subspace with the partition matrix and the fuzzification factor. By modifying the partition matrix, the new partition matrix is constructed through a series of matrix operations. We offer a thorough analysis of the developed scheme. Copyright © 2020, The Authors. Al

关键词： Granulation

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.

关键词：

Benchmarking quality-dependent and cost-sensitive score-level multimodal biometric fusion algorithms

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Poh, Norman Bourlai, Thirimachos Kittler, Josef Allano, Lorene Alonso-Fernandez, Fernando Ambekar, Onkar Baker, John Dorizzi, Bernadette Fatukasi, Omolara Fierrez, Julian Ganster, Harald Ortega-Garcia, Javier Maurer, Donald Salah, Albert Ali Scheidat, Tobias Vielhauer, Claus Centre for Vision Speech and Signal Processing School of Electronics and Physical Sciences University of Surrey Guildford SurreyGU2 7XH United Kingdom Biometrics Center Lane Department of Computer Science and Electrical Engineering College of Engineering and Mineral Resources West Virginia University MorgantownWV26506-6109 United States Institut Telecom Telecom and Management SudParis Evry91011 France Biometric Recognition Group – ATVS Escuela Politecnica Superior Universidad Autonoma de Madrid Madrid28049 Spain Amsterdam1098 XG Netherlands Applied Physics Laboratory Johns Hopkins University LaurelMD20723 United States Electronics and Physics Department Institut Telecom Telecom and Management SudParis Evry91011 France Institute of Digital Image Processing Joanneum Research Graz8010 Austria ISLA-ISIS University of Amsterdam Amsterdam1098 XG Netherlands Department of Informatics and Media Brandenburg University of Applied Sciences Brandenburg an der HavelD-14770 Germany Research Group Multimedia and Security Department of Technical and Business Information Systems Faculty of Computer Science Otto-von-Guericke-University of Magdeburg MagdeburgD-39106 Germany

Automatically verifying the identity of a person by means of biometrics (e.g., face and fingerprint) is an important application in our day-to-day activities such as accessing banking services and security control in airports. To increase the system reliability, several biometric devices are often used. Such a combined system is known as a multimodal biometric system. This paper reports a benchmarking study carried out within the framework of the BioSecure DS2 (Access Control) evaluation campaign organized by the University of Surrey, involving face, fingerprint, and iris biometrics for person authentication, targeting the application of physical access control in a medium-size establishment with some 500 persons. While multimodal biometrics is a well-investigated subject in the literature, there exists no benchmark for a fusion algorithm comparison. Working towards this goal, we designed two sets of experiments: quality-dependent and cost-sensitive evaluation. The quality-dependent evaluation aims at assessing how well fusion algorithms can perform under changing quality of raw biometric images principally due to change of devices. The cost-sensitive evaluation, on the other hand, investigates how well a fusion algorithm can perform given restricted computation and in the presence of software and hardware failures, resulting in errors such as failure-to-acquire and failure-to-match. Since multiple capturing devices are available, a fusion algorithm should be able to handle this nonideal but nevertheless realistic scenario. In both evaluations, each fusion algorithm is provided with scores from each biometric comparison subsystem as well as the quality measures of both the template and the query data. The response to the call of the evaluation campaign proved very encouraging, with the submission of 22 fusion systems. To the best of our knowledge, this campaign is the first attempt to benchmark quality-based multimodal fusion algorithms. In the presence of changing

关键词： Benchmarking

Rotation invariant point cloud analysis: Where local geometry meets global topology

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Zhao, Chen Yang, Jiaqi Xiong, Xin Zhu, Angfan Cao, Zhiguo Li, Xin National Key Laboratory of Science and Technology on Multi-spectral Information Processing School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China School of Computer Science Northwestern Polytechnical University Xi’an710072 China Lane Department of Computer Science and Electrical Engineering West Virginia University Morgantown26506 United States

Point cloud analysis is a fundamental task in 3D computer vision. Most previous works have conducted experiments on synthetic datasets with well-aligned data;while real-world point clouds are often not pre-aligned. How to achieve rotation invariance remains an open problem in point cloud analysis. To meet this challenge, we propose an approach toward achieving rotation-invariant (RI) representations by combining local geometry with global topology. In our local-global-representation (LGR)-Net, we have designed a two-branch network where one stream encodes local geometric RI features and the other encodes global topology-preserving RI features. Motivated by the observation that local geometry and global topology have different yet complementary RI responses in varying regions, two-branch RI features are fused by an innovative multi-layer perceptron (MLP) based attention module. To the best of our knowledge, this work is the first principled approach toward adaptively combining global and local information under the context of RI point cloud analysis. Extensive experiments have demonstrated that our LGR-Net achieves the state-of-the-art performance on various rotation-augmented versions of ModelNet40, ShapeNet, ScanObjectNN, and S3DIS. Copyright © 2019, The Authors. All rights reserved.

关键词： Encoding (symbols)

Multi-view multi-instance multi-label learning based on collaborative matrix factorization

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Xing, Yuying Yu, Guoxian Domeniconi, Carlotta Wang, Jun Zhang, Zili Guo, Maozu College of Computer and Information Science Southwest University Chongqing China Hubei Key Laboratory of Intelligent Geo-Information Processing China University of Geosciences Wuhan China Department of Computer Science George Mason University FairfaxVA United States School of Information Technology Deakin University GeelongVIC Australia School of Electrical and Information Engineering Beijing University of Civil Engineering and Architecture Beijing China

Multi-view Multi-instance Multi-label Learning(M3L) deals with complex objects encompassing diverse instances, represented with different feature views, and annotated with multiple labels. Existing M3L solutions only partially explore the inter or intra relations between objects (or bags), instances, and labels, which can convey important contextual information for M3L. As such, they may have a compromised performance. In this paper, we propose a collaborative matrix factorization based solution called M3Lcmf. M3Lcmf first uses a heterogeneous network composed of nodes of bags, instances, and labels, to encode different types of relations via multiple relational data matrices. To preserve the intrinsic structure of the data matrices, M3Lcmf collaboratively factorizes them into low-rank matrices, explores the latent relationships between bags, instances, and labels, and selectively merges the data matrices. An aggregation scheme is further introduced to aggregate the instance-level labels into bag-level and to guide the factorization. An empirical study on benchmark datasets show that M3Lcmf outperforms other related competitive solutions both in the instance-level and bag-level prediction. Copyright © 2019, The Authors. All rights reserved.

关键词： Matrix factorization

The approximate parallelity of complex fuzzy sets

学校读者我要写书评

暂无评论

The approximate parallelity of complex fuzzy sets

作者： Hu, Bo Bi, Lvqing Dai, Songsong Li, Sizhao School of Mechanical and Electrical Engineering Guizhou Normal University Guiyang China School of Electronics and Communication Engineering Guangxi Colleges Universities Key Laboratory of Complex System Optimization and Big Data Processing Yulin Normal University Yulin China School of Information Science and Engineering Xiamen University Xiamen361005 China College of Computer Science and Technology Harbin Engineering University Harbin China

A complex fuzzy set is a set whose membership grades are complex values in the unit circle in the complex plane. This paper introduces the concept of approximate parallelity between complex fuzzy sets based on the phase of complex-valued membership grade. After that, the property of approximate parallelity preserving for complex fuzzy operators and complex fuzzy inference are investigated. © 2018 - IOS Press and the authors. All rights reserved.

关键词： Fuzzy inference