Sharif Digital Repository

Community detection in social networks is one of the advertising methods in electronic marketing. One of the approaches to find communities in large social networks is to use greedy methods, because these methods perform very fast. Greedy methods are generally designed based on local decisions; thus, inappropriate local decisions may result in an improper global solution. The use of a greedy improved index with a futuristic approach can, to some extent, prevent inappropriate local choices. Our proposed method determines the influential nodes in the social network based on the followers and following and new futuristic greedy index. It classifies the nodes based on the influential nodes by... 

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

This paper proposes an Age-Dependent Clustering (ADC) structure to be used for prognostics. To achieve this aim, a step-by-step methodology is introduced, that includes clustering, reproduction, mapping, and finally estimation of Remaining Useful Life (RUL). In the mapping step, a neural fitting tool is used. To clarify the age-based clustering concept, the main elements of the ADC model is discussed. A Genetic algorithm (GA) is used to find the elements of the optimal model. Lastly, the fuzzy technique is applied to modify the clustering. By investigating a case study on the health monitoring of some turbofan engines, the efficacy of the proposed method is demonstrated. The results showed... 

Failure Mode and Effect Analysis (FMEA) is an effective risk analysis and failure avoidance approach in the design, process, services, and system. With all its benefits, FMEA has three limitations: failure mode risk assessment and prioritization, complex FMEA worksheets, and difficult application of FMEA tables. This paper seeks to overcome the shortcomings of FMEA using an integrated approach based on a developed Pythagorean fuzzy (PF) k-means clustering algorithm and a popular MCDM method called PF-VIKOR. In the first step, Pythagorean fuzzy numbers (PFNs) were used to collect Severity (S), Occurrence (O), and Detection (D) factors for failure modes to incorporate uncertainty and fuzziness... 

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

The growing number of Internet users and the prevalence of web applications make it necessary to deal with very complex software and applications in the network. This results in an increasing number of new vulnerabilities in the systems, and leading to an increase in cyber threats and, in particular, zero-day attacks. The cost of generating appropriate signatures for these attacks is a potential motive for using machine learning-based methodologies. Although there are many studies on using learning-based methods for attack detection, they generally use extracted features and overlook raw contents. This approach can lessen the performance of detection systems against content-based attacks... 

Graph signal processing (GSP) have found many applications in different domains. The underlying graph may not be available in all applications, and it should be learned from the data. There exist complicated data, where the graph changes over time. Hence, it is necessary to estimate the dynamic graph. In this paper, a new dynamic graph learning algorithm, called dynamic K-graphs, is proposed. This algorithm is capable of both estimating the time-varying graph and clustering the temporal graph signals. Numerical experiments demonstrate the high performance of this algorithm compared with other algorithms. © 2021 European Signal Processing Conference, EUSIPCO. All rights reserved  

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

This paper presents a multi-stage algorithm for QRS complex classification into normal and abnormal categories using an unsupervised sequential beat clustering and a cross-distance analysis algorithm. After the sequential beat clustering, a search algorithm based on relative similarity of created classes is used to detect the main normal class. Then other classes are labeled based on a distance measurement from the main normal class. Evaluated results on the MIT-BIH ECG database exhibits an error rate less than 1% for normal and abnormal discrimination and 0.2% for clustering of 15 types of arrhythmia existing on the MIT-BIH database. © 2001 IEEE  

Partial discharge (PD) activity can be destructive to the transformer insulation, and ultimately may result in total breakdown of the insulation. Partial discharge sources identification in a power transformer enables the operator to evaluate the transformer insulation condition during its lifetime. In order to identify the PD source; in the case of presence of multiple sources; the first step is to capture the PD signals and to extract their specific features. In this contribution, the frequency domain analysis, the time domain analysis and the wavelet transform are employed for feature extraction purpose. In practice, there might be plenty of features, and in each scenario, only some of... 

Today's world needs new methods to deal with and analyze the ever-increasingly generated data streams. Two of the most challenging aspects of data streams are (i) concept drift, i.e. evolution of data stream over time, which requires the ability to make timely decisions against the high speed of receiving new data; (ii) limited memory storage and the impracticality of using memory due to the large amount of data. Clustering is one of the common methods to process data streams. In this paper, we propose a novel, fully-online, density-based method for clustering evolving data streams. In recent years, a number of methods have been proposed, which also have the ability to cluster data streams.... 

The k-means is the most popular clustering algorithm, but, as it needs too many distance computations, its speed is dramatically fall down against high-dimensional data. Although, there are some quite fast variants proposed in literature, but, there is still much room for improvement against high-dimensional large-scale datasets. What proposed here, k-means-g*, is based on a simple geometric concept. For four distinct points, if distance between all pairs except one pair are known, then, a lower bound can be determined for the unknown distance. Utilizing this technique in the assignment step of the k-means, many high-dimensional distance computations can be easily ignored, where small amount... 

The Internet of Things (IoT) is a new concept in the world of technology and information and has many applications in industry, communications, and various other fields. In the lowest layer of the IoT, wireless sensor networks (WSNs) play an important and pivotal role. WSN consists of a large number of sensors and is commonly used to monitor a target. It is important to reduce energy consumption in WSNs to extend network life, since it is usually impossible to replace sensor batteries. In this paper, a novel clustering and routing method is proposed. It is mainly based on genetic algorithms and equilibrium optimization. To improve scalability, the sensor nodes are clustered in the first... 

This paper presents a multi-objective availability-redundancy allocation optimization model for a hyper-system. The hyper-system consists of B systems with shared resources. The structure of the systems is series-parallel subsystems consisting of multi-failure and multi-state components. The components may be purchased from different suppliers based on their price and discounts. It is assumed that technical and organizational activities continuously affect the components' failure rates and the subsystems' working conditions before starting the system's mission horizon. The model aims to find the optimal number and the type of the subsystems' components for all systems from each supplier and... 

The growing number of Internet users and the prevalence of web applications make it necessary to deal with very complex software and applications in the network. This results in an increasing number of new vulnerabilities in the systems, and leading to an increase in cyber threats and, in particular, zero-day attacks. The cost of generating appropriate signatures for these attacks is a potential motive for using machine learning-based methodologies. Although there are many studies on using learning-based methods for attack detection, they generally use extracted features and overlook raw contents. This approach can lessen the performance of detection systems against content-based attacks... 

The visibility graph of a polygon corresponds to its internal diagonals and boundary edges. For each vertex on the boundary of the polygon, we have a vertex in this graph and if two vertices of the polygon see each other there is an edge between their corresponding vertices in the graph. Two vertices of a polygon see each other if and only if their connecting line segment completely lies inside the polygon. Recognizing visibility graphs is the problem of deciding whether there is a simple polygon whose visibility graph is isomorphic to a given graph. Another important problem is to reconstruct such a polygon if there is any. These problems are well known and well-studied, but yet open...