Loading...
Search for: spectral-clustering
0.01 seconds

    Local graph clustering with network lasso

    , Article IEEE Signal Processing Letters ; Volume 28 , 2021 , Pages 106-110 ; 10709908 (ISSN) Jung, A ; Sarcheshmehpour, Y ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2021
    Abstract
    We study the statistical and computational properties of a network Lasso method for local graph clustering. The clusters delivered by nLasso can be characterized elegantly via network flows between cluster boundaries and seed nodes. While spectral clustering methods are guided by a minimization of the graph Laplacian quadratic form, nLasso minimizes the total variation of cluster indicator signals. As demonstrated theoretically and numerically, nLasso methods can handle very sparse clusters (chain-like) which are difficult for spectral clustering. We also verify that a primal-dual method for non-smooth optimization allows to approximate nLasso solutions with optimal worst-case convergence... 

    Functional Connectivity Detection in Resting-State Brain using functional Magnetic Resonance Imaging

    , M.Sc. Thesis Sharif University of Technology Ramezani, Mahdi (Author) ; Fatemizadeh, Emadeddin (Supervisor) ; Soltanianzadeh, Hamid (Supervisor)
    Abstract
    The functional network of the human brain is altered in many neurological and psychiatric disorders. Characterizing brain activity in terms of functionally segregated regions does not reveal anything about the communication among different brain regions and how such inter-communication could influence neural activity in each local region. The aim of this project is to assess the functional connectivity from resting state functional magnetic resonance imaging (fMRI) data. Spectral clustering algorithm was applied to the simulated, realistic and real fMRI data acquired from a resting healthy subject to find functionally connected brain regions. In order to make computation of the spectral... 

    Unsupervised induction of persian semantic verb classes based on syntactic information

    , Article Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Warsaw ; Volume 7912 LNCS , June , 2013 , Pages 112-124 ; 03029743 (ISSN) ; 9783642386336 (ISBN) Aminian, M ; Rasooli, M. S ; Sameti, H ; Sharif University of Technology
    2013
    Abstract
    Automatic induction of semantic verb classes is one of the most challenging tasks in computational lexical semantics with a wide variety of applications in natural language processing. The large number of Persian speakers and the lack of such semantic classes for Persian verbs have motivated us to use unsupervised algorithms for Persian verb clustering. In this paper, we have done experiments on inducing the semantic classes of Persian verbs based on Levin's theory for verb classes. Syntactic information extracted from dependency trees is used as base features for clustering the verbs. Since there has been no manual classification of Persian verbs prior to this paper, we have prepared a... 

    Spectral Graph Partitioning

    , M.Sc. Thesis Sharif University of Technology Behjati, Shahab (Author) ; Daneshgar, Amir (Supervisor)
    Abstract
    Graph partitioning, or graph clustering, is an essential researa problem in many areas. In this thesis, we focus on the partitioning problem of unweighted undirected graph, that is, graphs for which the weight of all edges is 1. We will investigate spectral methods for solving the graph partitioning and we compare them. In addition to theoretical analysis,We also implement some of spectral algorithms in matlab and apply them on standard graph data sets. Finally, the experimental
    results obtained are offering  

    A Symmetric Kernel Matrix for Community Detection in Directed Complex Networks

    , M.Sc. Thesis Sharif University of Technology Firouzi, Hamid Reza (Author) ; Roosta Azad, Reza (Supervisor) ; Zarei, Mina (Co-Advisor)
    Abstract
    Complex directed networks are widely used in representing, modeling and summarizing various homo and heterogeneous real networks such as protein-protein interactions, social and twitting networks, brain connectomes, chipsets mapping and marketing. While working on undirected networks in the hope for detecting communities or any other static and dynamic structures, has been on agenda of many physician and computer scientists, dealing with directed ones seems more challengeable for quick advances. Availability of theoretical basis especially symmetric adjacency matrix recommends modeling with undirected graphs but we believe that directed graphs are more general and practical to model real... 

    Effective Connectivity Analysis in Neural circuitry Underlying Perceptual and Value-based Memory

    , M.Sc. Thesis Sharif University of Technology Fakharian, Mohammad Amin (Author) ; Amini, Arash (Supervisor) ; Ghazizadeh, Ali (Co-Supervisor)
    Abstract
    Perceptual memory used in novel vs familiar discrimination is not only vital for the evaluation of environmental variations but also essential for learning, perception, and correcting behavioral policies. On the other hand, value-based memory which allows for discrimination of valuable objects among equally familiar ones also drives behavioral interactions and decision making. Although many studies have been conducted to address the neuronal association regarding each separately, the neural correspondence between perceptual and value-based memory is not scrutinized adequately. To this end, the differential neural activation in two macaque monkeys to unrewarded novel vs familiar fractals (>100... 

    A novel graphical approach to automatic abstraction in reinforcement learning

    , Article Robotics and Autonomous Systems ; Volume 61, Issue 8 , 2013 , Pages 821-835 ; 09218890 (ISSN) Taghizadeh, N ; Beigy, H ; Sharif University of Technology
    2013
    Abstract
    Recent researches on automatic skill acquisition in reinforcement learning have focused on subgoal discovery methods. Among them, algorithms based on graph partitioning have achieved higher performance. In this paper, we propose a new automatic skill acquisition framework based on graph partitioning approach. The main steps of this framework are identifying subgoals and discovering useful skills. We propose two subgoal discovery algorithms, which use spectral analysis on the transition graph of the learning agent. The first proposed algorithm, incorporates k′-means algorithm with spectral clustering. In the second algorithm, eigenvector centrality measure is utilized and options are... 

    Graphic: Graph-based hierarchical clustering for single-molecule localization microscopy

    , Article 18th IEEE International Symposium on Biomedical Imaging, ISBI 2021, 13 April 2021 through 16 April 2021 ; Volume 2021-April , 2021 , Pages 1892-1896 ; 19457928 (ISSN); 9781665412469 (ISBN) Pourya, M ; Aziznejad, S ; Unser, M ; Sage, D ; Sharif University of Technology
    IEEE Computer Society  2021
    Abstract
    We propose a novel method for the clustering of point-cloud data that originate from single-molecule localization microscopy (SMLM). Our scheme has the ability to infer a hierarchical structure from the data. It takes a particular relevance when quantitatively analyzing the biological particles of interest at different scales. It assumes a prior neither on the shape of particles nor on the background noise. Our multiscale clustering pipeline is built upon graph theory. At each scale, we first construct a weighted graph that represents the SMLM data. Next, we find clusters using spectral clustering. We then use the output of this clustering algorithm to build the graph in the next scale; in... 

    An Active Learning Algorithm for Spam Filtering

    , M.Sc. Thesis Sharif University of Technology Shadloo, Maryam (Author) ; Beigy, Hamid (Supervisor)
    Abstract
    Content-based spam filtering problem is defined as classifying input emails into spam and legitimate emails. so it is considered as an application of supervised-learning. The supervised learning methods often require a large training set of labelled emails to attain good accuracy and the users should label huge amount of emails. In reality, it is not reasonable to expect users to do this. To address this issue and reduce number of labelling request from user active learning techniques can be used. The goal of active Learning algorithms is to achieve appropriate accuracy by using fewer amounts of labelled data in comparison with supervised-learning methods.In this thesis two active learning... 

    Functional Connectivity Network in Rest-State fMRI Baseline in High Functioning Autism Disorder

    , M.Sc. Thesis Sharif University of Technology Akbarian Aghdam, Amir (Author) ; Fatemizadeh, Emad (Supervisor)
    Abstract
    Autism spectrum disorders (ASD) have been defined as developmental disorders characterized by abnormalities in social interaction, communication skills, and behavioral flexibility. Over the past decades, studies using various genetic, neurobiological, cognitive and behavioral approaches have sought a single explanation for the heterogeneous manifestations of ASD, but no consensus on the etiology of ASD has emerged. Further studies aim to clarify the mechanism of disease.
    Functional Magnetic Resonance Imaging (fMRI) is a new way of imaging which evaluates activity of brain by measuring magnetic difference caused by oscillation in blood oxygen level. fMRI has been widely used in recent... 

    Large-scale image annotation using prototype-based models

    , Article ISPA 2011 - 7th International Symposium on Image and Signal Processing and Analysis ; 2011 , Pages 449-454 ; 9789531841597 (ISBN) Amiri, S. H ; Jamzad, M ; European Association for Signal Processing (EURASIP); IEEE Signal Processing Society; IEEE Region 8; IEEE Croatia Section; IEEE Croatia Section Signal Processing Chapter ; Sharif University of Technology
    Abstract
    Automatic image annotation is a challenging problem in the field of image retrieval. Dealing with large databases makes the annotation problem more difficult and therefore an effective approach is needed to manage such databases. In this work, an annotation system has been developed which considers images in separate categories and constructs a profiling model for each category. To describe an image, we propose a new feature extraction method based on color and texture information that describes image content using discrete distribution signatures. Image signatures of one category are partitioned using spectral clustering and a prototype is determined for each cluster by solving an... 

    Spectral clustering approach with sparsifying technique for functional connectivity detection in the resting brain

    , Article 2010 International Conference on Intelligent and Advanced Systems, ICIAS 2010, 15 June 2010 through 17 June 2010 ; 2010 ; 9781424466238 (ISBN) Ramezani, M ; Heidari, A ; Fatemizadeh, E ; Soltanianzadeh, H ; Sharif University of Technology
    Abstract
    The aim of this study is to assess the functional connectivity from resting state functional magnetic resonance imaging (fMRI) data. Spectral clustering algorithm was applied to the realistic and real fMRI data acquired from a resting healthy subject to find functionally connected brain regions. In order to make computation of the spectral decompositions of the entire brain volume feasible, the similarity matrix has been sparsified with the t-nearestneighbor approach. Realistic data were created to investigate the performance of the proposed algorithm and comparing it to the recently proposed spectral clustering algorithm with the Nystrom approximation and also with some well-known...