Loading...
Search for: dimensionality-reduction
0.006 seconds
Total 31 records

    Various reduced-order surrogate models for fluid flow and mass transfer in human bronchial tree

    , Article Biomechanics and Modeling in Mechanobiology ; Volume 20, Issue 6 , 2021 , Pages 2203-2226 ; 16177959 (ISSN) Abbasi, Z ; Bozorgmehry Boozarjomehry, R ; Sharif University of Technology
    Springer Science and Business Media Deutschland GmbH  2021
    Abstract
    The bronchial tree plays a main role in the human respiratory system because the air distribution throughout the lungs and gas exchange with blood occur in the airways whose dimensions vary from several centimeters to micrometers. Organization of about 60,000 conducting airways and 33 million respiratory airways in a limited space results in a complex structure. Due to this inherent complexity and a high number of airways, using target-oriented dimensional reduction is inevitable. In addition, there is no general reduced-order model for various types of problems. This necessitates coming up with an appropriate model from a variety of different reduced-order models to solve the desired... 

    Various reduced-order surrogate models for fluid flow and mass transfer in human bronchial tree

    , Article Biomechanics and Modeling in Mechanobiology ; Volume 20, Issue 6 , 2021 , Pages 2203-2226 ; 16177959 (ISSN) Abbasi, Z ; Bozorgmehry Boozarjomehry, R ; Sharif University of Technology
    Springer Science and Business Media Deutschland GmbH  2021
    Abstract
    The bronchial tree plays a main role in the human respiratory system because the air distribution throughout the lungs and gas exchange with blood occur in the airways whose dimensions vary from several centimeters to micrometers. Organization of about 60,000 conducting airways and 33 million respiratory airways in a limited space results in a complex structure. Due to this inherent complexity and a high number of airways, using target-oriented dimensional reduction is inevitable. In addition, there is no general reduced-order model for various types of problems. This necessitates coming up with an appropriate model from a variety of different reduced-order models to solve the desired... 

    Multiclass classification of patients during different stages of Alzheimer's disease using fMRI time-series

    , Article Biomedical Physics and Engineering Express ; Volume 6, Issue 5 , 2020 Ahmadi, H ; Fatemizadeh, E ; Motie Nasrabadi, A ; Sharif University of Technology
    IOP Publishing Ltd  2020
    Abstract
    Alzheimer's Disease (AD) begins several years before the symptoms develop. It starts with Mild Cognitive Impairment (MCI) which can be separated into Early MCI and Late MCI (EMCI and LMCI). Functional connectivity analysis and classification are done among the different stages of illness with Functional Magnetic Resonance Imaging (fMRI). In this study, in addition to the four stages including healthy, EMCI, LMCI, and AD, the patients have been tracked for a year. Indeed, the classification has been done among 7 groups to analyze the functional connectivity changes in one year in different stages. After generating the functional connectivity graphs for eliminating the weak links, three... 

    A sensitivity study of FILTERSIM algorithm when applied to DFN modeling

    , Article Journal of Petroleum Exploration and Production Technology ; Vol. 4, issue. 2 , June , 2014 , p. 153-174 ; ISSN: 21900558 Ahmadi, R ; Masihi, M ; Rasaei, M. R ; Eskandaridalvand, K ; Shahalipour, R ; Sharif University of Technology
    Abstract
    Realistic description of fractured reservoirs demands primarily for a comprehensive understanding of fracture networks and their geometry including various individual fracture parameters as well as network connectivities. Newly developed multiple-point geostatistical simulation methods like SIMPAT and FILTERSIM are able to model connectivity and complexity of fracture networks more effectively than traditional variogrambased methods. This approach is therefore adopted to be used in this paper. Among the multiple-point statistics algorithms, FILTERSIM has the priority of less computational effort than does SIMPAT by applying filters and modern dimensionality reduction techniques to the... 

    Comparison of classification and dimensionality reduction methods used in fMRI decoding

    , Article Iranian Conference on Machine Vision and Image Processing, MVIP ; 2013 , Pages 175-179 ; 21666776 (ISSN) ; 9781467361842 (ISBN) Alamdari, N. T ; Fatemizadeh, E ; Sharif University of Technology
    2013
    Abstract
    In the last few years there has been growing interest in the use of functional Magnetic Resonance Imaging (fMRI) for brain mapping. To decode brain patterns in fMRI data, we need reliable and accurate classifiers. Towards this goal, we compared performance of eleven popular pattern recognition methods. Before performing pattern recognition, applying the dimensionality reduction methods can improve the classification performance; therefore, seven methods in region of interest (RDI) have been compared to answer the following question: which dimensionality reduction procedure performs best? In both tasks, in addition to measuring prediction accuracy, we estimated standard deviation of... 

    Optimal supervised feature extraction in internet traffic classification

    , Article IEEE Pacific RIM Conference on Communications, Computers, and Signal Processing - Proceedings ; 2013 , Pages 102-107 ; 1555-5798 (ISSN) ; 9781479915019 (ISBN) Aliakbarian, M. S ; Fanian, A ; Saleh, F. S ; Gulliver, T. A ; Sharif University of Technology
    2013
    Abstract
    Internet traffic classification is important in many aspects of network management such as data exploitation detection, malicious user identification, and restricting application traffic. Previously, features such as port and protocol numbers have been used to classify traffic, but these features can now be changed easily, making their use in traffic classification inadequate. Consequently, traffic classification based on machine learning (ML) is now employed. The number of features used in an ML algorithm has a significant impact on performance, in particular accuracy. In this paper, a minimum best feature set is chosen using a supervised method to obtain uncorrelated features. Outlier... 

    Variants of vector space reductions for predicting the compositionality of English noun compounds

    , Article 12th International Conference on Language Resources and Evaluation, LREC 2020, 11 May 2020 through 16 May 2020 ; 2020 , Pages 4379-4387 Alipoor, P ; Schulte im Walde, S ; Sharif University of Technology
    European Language Resources Association (ELRA)  2020
    Abstract
    Predicting the degree of compositionality of noun compounds such as snowball and butterfly is a crucial ingredient for lexicography and Natural Language Processing applications, to know whether the compound should be treated as a whole, or through its constituents, and what it means. Computational approaches for an automatic prediction typically represent and compare compounds and their constituents within a vector space and use distributional similarity as a proxy to predict the semantic relatedness between the compounds and their constituents as the compound's degree of compositionality. This paper provides a systematic evaluation of vector-space reduction variants across kinds, exploring... 

    Low-rank matrix approximation using point-wise operators

    , Article IEEE Transactions on Information Theory ; Volume 58, Issue 1 , September , 2012 , Pages 302-310 ; 00189448 (ISSN) Amini, A ; Karbasi, A ; Marvasti, F ; Sharif University of Technology
    Abstract
    The problem of extracting low-dimensional structure from high-dimensional data arises in many applications such as machine learning, statistical pattern recognition, wireless sensor networks, and data compression. If the data is restricted to a lower dimensional subspace, then simple algorithms using linear projections can find the subspace and consequently estimate its dimensionality. However, if the data lies on a low-dimensional but nonlinear space (e.g., manifolds), then its structure may be highly nonlinear and, hence, linear methods are doomed to fail. In this paper, we introduce a new technique for dimensionality reduction based on point-wise operators. More precisely, let $ {bf A} n... 

    Ordinal embedding: Approximation algorithms and dimensionality reduction

    , Article 11th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2008 and 12th International Workshop on Randomization and Computation, RANDOM 2008, Boston, MA, 25 August 2008 through 27 August 2008 ; Volume 5171 LNCS , 2008 , Pages 21-34 ; 03029743 (ISSN) ; 9783540853626 (ISBN) Bǎdoiu, M ; Demaine, E. D ; Hajiaghayi, M ; Sidiropoulos, A ; Zadimoghaddam, M ; Sharif University of Technology
    2008
    Abstract
    This paper studies how to optimally embed a general metric, represented by a graph, into a target space while preserving the relative magnitudes of most distances. More precisely, in an ordinal embedding, we must preserve the relative order between pairs of distances (which pairs are larger or smaller), and not necessarily the values of the distances themselves. The relaxation of an ordinal embedding is the maximum ratio between two distances whose relative order is inverted by the embedding. We develop polynomial-time constant-factor approximation algorithms for minimizing the relaxation in an embedding of an unweighted graph into a line metric and into a tree metric. These two basic target... 

    Two-dimensional random projection

    , Article Signal Processing ; Volume 91, Issue 7 , 2011 , Pages 1589-1603 ; 01651684 (ISSN) Eftekhari, A ; Babaie-Zadeh, M ; Abrishami Moghaddam, H ; Sharif University of Technology
    2011
    Abstract
    As an alternative to adaptive nonlinear schemes for dimensionality reduction, linear random projection has recently proved to be a reliable means for high-dimensional data processing. Widespread application of conventional random projection in the context of image analysis is, however, mainly impeded by excessive computational and memory requirements. In this paper, a two-dimensional random projection scheme is considered as a remedy to this problem, and the associated key notion of concentration of measure is closely studied. It is then applied in the contexts of image classification and sparse image reconstruction. Finally, theoretical results are validated within a comprehensive set of... 

    Skin detection using contourlet texture analysis

    , Article 2009 14th International CSI Computer Conference, CSICC 2009, 20 October 2009 through 21 October 2009, Tehran ; 2009 , Pages 367-372 ; 9781424442621 (ISBN) Fotouhi, M ; Rohban, M. H ; Kasaei, S ; Sharif University of Technology
    Abstract
    A combined texture- and color-based skin detection is proposed in this paper. Nonsubsampled contourlet transform is used to represent texture of the whole image. Local neighbor contourlet coefficients of a pixel are used as feature vectors to classify each pixel. Dimensionality reduction is addressed through principal component analysis (PCA) to remedy the curse of dimensionality in the training phase. Before texture classification, the pixel is tested to determine whether it is skin-colored. Therefore, the classifier is learned to discriminate skin and non-skin texture for skin colored regions. A multi-layer perceptron is then trained using the feature vectors in the PCA reduced space. The... 

    An efficient semi-supervised multi-label classifier capable of handling missing labels

    , Article IEEE Transactions on Knowledge and Data Engineering ; 2018 ; 10414347 (ISSN) Hosseini Akbarnejad, A ; Soleymani Baghshah, M ; Sharif University of Technology
    IEEE Computer Society  2018
    Abstract
    Multi-label classification has received considerable interest in recent years. Multi-label classifiers usually need to address many issues including: handling large-scale datasets with many instances and a large set of labels, compensating missing label assignments in the training set, considering correlations between labels, as well as exploiting unlabeled data to improve prediction performance. To tackle datasets with a large set of labels, embedding-based methods represent the label assignments in a low dimensional space. Many state-of-the-art embedding-based methods use a linear dimensionality reduction to map the label assignments to a low-dimensional space. However, by doing so, these... 

    An Efficient semi-supervised multi-label classifier capable of handling missing labels

    , Article IEEE Transactions on Knowledge and Data Engineering ; Volume 31, Issue 2 , 2019 , Pages 229-242 ; 10414347 (ISSN) Hosseini Akbarnejad, A ; Soleymani Baghshah, M ; Sharif University of Technology
    IEEE Computer Society  2019
    Abstract
    Multi-label classification has received considerable interest in recent years. Multi-label classifiers usually need to address many issues including: handling large-scale datasets with many instances and a large set of labels, compensating missing label assignments in the training set, considering correlations between labels, as well as exploiting unlabeled data to improve prediction performance. To tackle datasets with a large set of labels, embedding-based methods represent the label assignments in a low-dimensional space. Many state-of-the-art embedding-based methods use a linear dimensionality reduction to map the label assignments to a low-dimensional space. However, by doing so, these... 

    Robust fuzzy rough set based dimensionality reduction for big multimedia data hashing and unsupervised generative learning

    , Article Multimedia Tools and Applications ; Volume 80, Issue 12 , 2021 , Pages 17745-17772 ; 13807501 (ISSN) Khanzadi, P ; Majidi, B ; Adabi, S ; Patra, J. C ; Movaghar, A ; Sharif University of Technology
    Springer  2021
    Abstract
    The amount of high dimensional data produced by visual sensors in the smart environments and by autonomous vehicles is increasing exponentially. In order to search and model this data for real-time applications, the dimensionality of the data should be reduced. In this paper, a novel dimensionality reduction algorithm based on fuzzy rough set theory, called Centralized Binary Mapping (CBM), is proposed. The fuzzy CBM kernel is used for extracting the central elements and the memory cells from the blocks of high dimensional data. The proposed applications of CBM in this paper include hashing and generative modelling of multimedia big data. The robustness of the proposed CBM based hashing... 

    An exploratory study to design a novel hand movement identification system

    , Article Computers in Biology and Medicine ; Volume 39, Issue 5 , 2009 , Pages 433-442 ; 00104825 (ISSN) Khezri, M ; Jahed, M ; Sharif University of Technology
    2009
    Abstract
    Electromyogram signal (EMG) is an electrical manifestation of contractions of muscles. Surface EMG (sEMG) signal collected from the surface of skin has been used in diverse applications. One of its usages is in pattern recognition of hand prosthesis movements. The ability of current prosthesis devices has been generally limited to simple opening and closing tasks, minimizing their efficacy compared to natural hand capabilities. In order to extend the abilities and accuracy of prosthesis arm movements and performance, a novel sEMG pattern recognizing system is proposed. To extract more pertinent information we extracted sEMGs for selected hand movements. These features constitute our main... 

    Manifold learning for ECG arrhythmia recognition

    , Article 2013 20th Iranian Conference on Biomedical Engineering, ICBME 2013 ; 2013 , Pages 126-131 Lashgari, E ; Jahed, M ; Khalaj, B ; Sharif University of Technology
    IEEE Computer Society  2013
    Abstract
    Heart is a complex system and we can find its function in electrocardiogram (ECG) signal. The records show high mortality rate of heart diseases. So it is essential to detect and recognize ECG arrhythmias. The problem with ECG analysis is the vast variations among morphologies of ECG signals. Premature Ventricular Contractions (PVC) is a common type of arrhythmia which may lead to critical situations and contains risk. This study, proposes a novel approach for detecting PVC and visualizing data with respect to ECG morphologies by using manifold learning. To this end, the Laplacian Eigenmaps - One of the reduction method and it is in the nonlinear category - is used to extract important... 

    Private Inner product retrieval for distributed machine learning

    , Article 2019 IEEE International Symposium on Information Theory, ISIT 2019, 7 July 2019 through 12 July 2019 ; Volume 2019-July , 2019 , Pages 355-359 ; 21578095 (ISSN); 9781538692912 (ISBN) Mousavi, M. H ; Maddah Ali, M. A ; Mirmohseni, M ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2019
    Abstract
    In this paper, we argue that in many basic algorithms for machine learning, including support vector machine (SVM) for classification, principal component analysis (PCA) for dimensionality reduction, and regression for dependency estimation, we need the inner products of the data samples, rather than the data samples themselves.Motivated by the above observation, we introduce the problem of private inner product retrieval for distributed machine learning, where we have a system including a database of some files, duplicated across some non-colluding servers. A user intends to retrieve a subset of specific size of the set of the inner product of every pair of data items in the database with... 

    Nonlinear Dimensionality Reduction via Path-Based Isometric Mapping

    , Article IEEE Transactions on Pattern Analysis and Machine Intelligence ; Volume 38, Issue 7 , 2016 , Pages 1452-1464 ; 01628828 (ISSN) Najafi, A ; Joudaki, A ; Fatemizadeh, E ; Sharif University of Technology
    IEEE Computer Society 
    Abstract
    Nonlinear dimensionality reduction methods have demonstrated top-notch performance in many pattern recognition and image classification tasks. Despite their popularity, they suffer from highly expensive time and memory requirements, which render them inapplicable to large-scale datasets. To leverage such cases we propose a new method called "Path-Based Isomap". Similar to Isomap, we exploit geodesic paths to find the low-dimensional embedding. However, instead of preserving pairwise geodesic distances, the low-dimensional embedding is computed via a path-mapping algorithm. Due to the much fewer number of paths compared to number of data points, a significant improvement in time and memory... 

    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... 

    A new ensemble method for feature ranking in text mining

    , Article International Journal on Artificial Intelligence Tools ; Volume 22, Issue 3 , June , 2013 ; 02182130 (ISSN) Sadeghi, S ; Beigy, H ; Sharif University of Technology
    2013
    Abstract
    Dimensionality reduction is a necessary task in data mining when working with high dimensional data. A type of dimensionality reduction is feature selection. Feature selection based on feature ranking has received much attention by researchers. The major reasons are its scalability, ease of use, and fast computation. Feature ranking methods can be divided into different categories and may use different measures for ranking features. Recently, ensemble methods have entered in the field of ranking and achieved more accuracy among others. Accordingly, in this paper a Heterogeneous ensemble based algorithm for feature ranking is proposed. The base ranking methods in this ensemble structure are...