نتایج جستجو برای: k method

تعداد نتایج: 1955991  

Journal: :JCP 2011
Jian Wu Jie Xia Jianming Chen Zhiming Cui

We do research on moving object classification in traffic video. Our aim is to classify the moving objects into pedestrians, bicycles and vehicles. Due to the advantage of self-organizing feature map (SOM), an unsupervised learning algorithm, which is simple and self organization, and the common usage of K-means clustering method, this paper combines SOM with K-means to do classification of mov...

Journal: :Bioinformatics 2004
Ying Huang Yanda Li

MOTIVATION Protein localization data are a valuable information resource helpful in elucidating protein functions. It is highly desirable to predict a protein's subcellular locations automatically from its sequence. RESULTS In this paper, fuzzy k-nearest neighbors (k-NN) algorithm has been introduced to predict proteins' subcellular locations from their dipeptide composition. The prediction i...

2011
Abdul-Sattar J. Al-Saif Dhifaf A. Abood

In this paper, we present homotopy perturbation method (HPM) for solving the Korteweg-de Vries (KdV) equation and convergence study of homotopy perturbation method for nonlinear partial differential equation. We compared our solution with the exact solution and homotopy analysis method (HAM). The results show that the HPM is an appropriate method for solving nonlinear equation.

2016
Wei-Chang Yeh Yunzhi Jiang Yee-Fen Chen Zhe Chen

The K-harmonic means clustering algorithm (KHM) is a new clustering method used to group data such that the sum of the harmonic averages of the distances between each entity and all cluster centroids is minimized. Because it is less sensitive to initialization than K-means (KM), many researchers have recently been attracted to studying KHM. In this study, the proposed iSSO-KHM is based on an im...

2007
Grigorios Tsoumakas Ioannis P. Vlahavas

This paper proposes an ensemble method for multilabel classification. The RAndom k-labELsets (RAKEL) algorithm constructs each member of the ensemble by considering a small random subset of labels and learning a single-label classifier for the prediction of each element in the powerset of this subset. In this way, the proposed algorithm aims to take into account label correlations using single-...

2009
M. Usman C. Prieto T. Schaeffter P. Batchelor

Introduction: Up to now, besides sparsity, the standard compressed sensing methods used in MR do not exploit any other prior information about the underlying signal. In general, the MR data in its sparse representation always exhibits some structure. As an example, for dynamic cardiac MR data, the signal support in its sparse representation (x-f space) is always in compact form [1]. In this wor...

Journal: :JCP 2013
Yang Yang Xiang Long Bo Jiang

In hybrid cloud computing era, hybrid clusters which are consisted of virtual machines and physical machines become more and more Popular? . MapReduce is a good weapon in this big data era where social computing and multimedia computing are emerging. One of the biggest challenges in hybrid mapreduce cluster is I/O bottleneck which would be aggravated under big data computing. In this paper, we ...

1995
Joseph C. Pemberton

Many real-world problems, such as air-traffic control and factory scheduling, require that a sequence of decisions be made in real time. The real-time constraint means that we typically do not have sufficient time to find a complete solution to the problem using traditional methods before we must commit to a decision. We propose an incremental search approach to making real-time, sequential dec...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید