Sharif Digital Repository

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

We study the problem of preclustering a set B of imprecise points in Rd: we wish to cluster the regions specifying the potential locations of the points such that, no matter where the points are located within their regions, the resulting clustering approximates the optimal clustering for those locations. We consider k-center, k-median, and k-means clustering, and obtain the following results. Let B: = { b1, … , bn} be a collection of disjoint balls in Rd, where each ball bi specifies the possible locations of an input point pi. A partition C of B into subsets is called an (f(k) , α) -preclustering (with respect to the specific k-clustering variant under consideration) if (i) C consists of... 

The problem of allocating heterogeneous fleet of vehicles to the existing distribution network for dispensing products fro. manufacturing firm t. set of depots is considered. It is assume. heterogeneous fleet of vehicles with the given capacities and total costs consisting o. discounted fixed cost an. variable cost proportional to the amount shipped is employed for handling products. To minimize the total transportation costs, the problem is modeled i. form of the nonlinear mixed integer program. Due to the NP hard complexity of the mathematical model, three prioritized K-mean clustering hybrid GAs, by incorporating two new heuristic algorithms, are proposed. The efficiency of the algorithms... 

In this paper, a fast and accurate algorithm for identifying circular objects in images is proposed. The presented method is a robust, fast and optimized adaption of Circular Hough Transform (CHT), Eigenvalues of Covariance Matrix and K-means clustering techniques. Results are greatly improved by implementing iterative K-means clustering algorithm and establishing an exponential growth instead of updating values in the parameter space of CHT through summation, both in runtime and quality. In fact, using the Eigenvalues of Covariance Matrix as a validating method, a well balanced compromise between the speed and accuracy of results is achieved. This method is tested on several real world... 

We study the problem of preclustering a set B of imprecise points in Rd: we wish to cluster the regions specifying the potential locations of the points such that, no matter where the points are located within their regions, the resulting clustering approximates the optimal clustering for those locations. We consider k-center, k-median, and k-means clustering, and obtain the following results. Let B := {b1, . . ., bn} be a collection of disjoint balls in Rd, where each ball bi specifies the possible locations of an input point pi. A partition C of B into subsets is called an (f(k), α)preclustering (with respect to the specific k-clustering variant under consideration) if (i) C consists of... 

Mutations in Single Nucleotide Polymorphisms (SNPs - different variant positions (1%) from human genomes) are responsible for some genetic diseases. As a consequence, obtaining all SNPs from human populations is one of the primary goals of recent studies in human genomics. Two sequences of mentioned SNPs in diploid human organisms are called haplotypes. In this paper, we study haplotype reconstruction from SNP-fragments with and without genotype information, problems. Designing serial and parallel classifiers was center of our research. Genetic algorithm and K-means were two components of our approaches. This combination helps us to cover the single classifier's weaknesses. ©2008 IEEE  

COVID-19 pandemic caused an increasing demand for online academic classes, which led to the demand for effective online exams with regards to limitations on time and resources. Consequently, holding online exams with sufficient reliability and effectiveness became one of the most critical and challenging subjects in higher education. Therefore, it is essential to have a preventive algorithm to allocate time and financial resources effectively. In the present study, a fair test with sufficient validity is first defined, and then by analogy with an engineering product, the design process is implemented on it. For this purpose, a hybrid method based on FMEA, which is a preventive method to... 

This paper presented a comprehensive study on developing a deep learning approach for ultrasonic-based distributed damage assessment in concrete. In particular, two architectures of long short-term memory (LSTM) networks were proposed: (1) a classification model to evaluate the concrete's damage stage; (2) a regression model to predict the concrete's absorbed energy ratio. Two input configurations were considered and compared for both architectures: (1) the input was a single signal; (2) the inputs were four signals from four sides of the specimen. A comprehensive experimental study was designed and conducted on ground granulated blast furnace slag-based geopolymer concrete, providing a... 

Disease association study is of great importance among various fields of study in bioinformatics. Computational methods happen to be advantageous specifically when experimental approaches fail to obtain accurate results. Haplotypes are believed to be the most responsible biological data for genetic diseases. In this paper, the problem of reconstructing haplotypes from error-containing SNP fragments is discussed For this purpose, two new methods have been proposed by a combination of k-means clustering and particle swarm optimization algorithm. The methods and their implementation results on real biological and simulation datasets are represented which shows that they outperform the methods... 

A nonlinear integer programming model is developed in this article to solve redundancy allocation problems with multiple components having different failure rates in the series–parallel configuration using an active strategy. The main objective of this research is to select the number and the type of each component in subsystems so as the reliability of the system under certain constraints is maximized. To this aim, a weighted K-means clustering method is proposed, in which the analytical network process is employed to assign weights to the components of each cluster. As the proposed model belongs to the class of nondeterministic polynomial-time hardness problems, precise solution methods... 

Centroid-based methods including k-means and fuzzy c-means are known as effective and easy-to-implement approaches to clustering purposes in many applications. However, these algorithms cannot be directly applied to supervised tasks. This paper thus presents a generative model extending the centroid-based clustering approach to be applicable to classification and regression tasks. Given an arbitrary loss function, the proposed approach, termed Supervised Fuzzy Partitioning (SFP), incorporates labels information into its objective function through a surrogate term penalizing the empirical risk. Entropy-based regularization is also employed to fuzzify the partition and to weight features,... 

This paper presents an online portfolio selection algorithm based on pattern matching principle where it makes a decision on the optimal portfolio in each period and updates the optimal portfolio at the beginning of each period. The proposed method consists of two steps: i) sample selection, ii) portfolio optimization. First, in the sample selection, clustering algorithms including k-means, k-medoids, spectral and hierarchical clustering are applied to discover time windows (TW) similar to the recent time window. Then, after finding the similar time windows and predicting the market behavior of the next day, the optimum function along with the transaction cost is used in the portfolio... 

This paper presents a new algorithm for Blind Source Separation (BSS) of Instantaneous speech mixtures in under-determined case. A demixing algorithm which exploits the sparsity of speech signals in the short time Fourier transform (STFT) domain is proposed. This algorithm combines the modified k-means clustering procedure involved in the Line Orientation Separation Technique (LOST) with Smoothed l0-norm minimization (SL0) method. First procedure along with a transformation into a sparse domain tries to estimate the mixing matrix, and the second method tries to extract the sources from the mixtures. Simulation results are presented and compared to the Degenerate Unmixing Estimation Technique... 

Despite FPGAs rapidly evolving to support the requirements of the most demanding emerging applications, their high static power consumption, concentrated within the routing resources, still presents a major hurdle for low-power applications. Augmenting the FPGAs with power-gating ability is a promising way to effectively address the power-consumption obstacle. However, the main challenge when implementing power gating is in choosing the clusters of resources in a way that would allow the most power-saving opportunities. In this paper, we take advantage of machine learning approaches, such as K-means clustering, to propose efficient algorithms for creating power-gating clusters of FPGA...