Results 231 to 240 of about 43,679 (257)

An Enhanced Markov Clustering Algorithm Based on Physarum

2017
Community mining is a vital problem for complex network analysis. Markov chains based algorithms are known as its easy-to-implement and have provided promising solutions for community mining. Existing Markov clustering algorithms have been optimized from the aspects of parallelization and penalty strategy. However, the dynamic process for enlarging the
Mingxin Liang, Chao Gao 0001, Xianghua Li, Zili Zhang 0001   +3 more
openaire   +2 more sources

Markov Model Based Power Management in Server Clusters

2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing, 2010
Many high-end computing systems use an extremely large number of power-hungry commercial components to achieve high performance. Power reduction and energy conservation are important in these systems for the reason of minimizing operating cost. Two main mechanisms are commonly applied to power reduction in these systems: Dynamic Voltage/ Frequency ...
Xinying Zheng, Yu Cai 0002
openaire   +1 more source

Cluster adaptive training of hidden Markov models

IEEE Transactions on Speech and Audio Processing, 2000
When performing speaker adaptation, there are two conflicting requirements. First, the speaker transform must be powerful enough to represent the speaker. Second, the transform must be quickly and easily estimated for any particular speaker. The most popular adaptation schemes have used many parameters to adapt the models to be representative of an ...
openaire   +1 more source

Training of subspace distribution clustering hidden Markov model

Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181), 2002
Levinson, Juang and Sondhi (1986), and Mak, Bocchieri, and E. Barnard (see Proceedings of the IEEE Automatic Speech Recognition and Understanding Workshop, 1997) presented novel subspace distribution clustering hidden Markov models (SDCHMMs) which can be converted from continuous density hidden Markov models (CDHMMs) by clustering subspace Gaussians in
Brian Mak, Enrico Bocchieri
openaire   +1 more source

Influence Maximization Algorithm Using Markov Clustering

2013
Social Network Services are known as a effective marketing platform in that the customers trust the advertisement provided by their friends and neighbors. Viral Marketing is a marketing technique that uses the pre-constructed social networks to perform maketing with small cost while maximizing the spread.
Chungrim Kim, Sangkeun Lee 0001, Sungchan Park, Sang-goo Lee   +3 more
openaire   +1 more source

Efficient Markov clustering algorithm for protein sequence grouping

2013 35th Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC), 2013
In this paper we propose an efficient reformulation of a Markov clustering algorithm, suitable for fast and accurate grouping of protein sequences, based on pairwise similarity information. The proposed modification consists of optimal reordering of rows and columns in the similarity matrix after every iteration, transforming it into a matrix with ...
László Szilágyi, Sándor M. Szilágyi
openaire   +2 more sources

Deep Markov Clustering for Panoptic Segmentation

ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2022
Minxiang Ye, Yifei Zhang, Shiqiang Zhu, Anhuan Xie, Dan Zhang   +4 more
openaire   +1 more source

Clustering with hidden Markov model on variable blocks

J. Mach. Learn. Res., 2017
Summary: Large-scale data containing multiple important rare clusters, even at moderately high dimensions, pose challenges for existing clustering methods. To address this issue, we propose a new mixture model called Hidden Markov Model on Variable Blocks (HMM-VB) and a new mode search algorithm called Modal Baum-Welch (MBW) for mode-association ...
Lin Lin 0003, Jia Li 0001
openaire   +2 more sources

Constrained Spectral Clustering Using Absorbing Markov Chains

2012
Constrained spectral clustering (CSC) has recently shown great promise in improving clustering accuracy or catering for some specific grouping bias by encoding pairwise constraints into spectral clustering. Essentially, the existing CSC algorithms coarsely lie in two camps in terms of encoding pairwise constraints: (1) they modify the original ...
Jianyuan Li, Jihong Guan
openaire   +1 more source

Fast Markov Clustering Algorithm Based on Belief Dynamics

IEEE Transactions on Cybernetics, 2023
Hui-Jia Li, Wenzhe Xu, Chenyang Qiu
exaly