Hierarchical Maximum Likelihood Clustering Approach
نویسندگان
چکیده
منابع مشابه
Hierarchical Maximum-Margin Clustering
We present a hierarchical maximum-margin clustering method for unsupervised data analysis. Our method extends beyond flat maximummargin clustering, and performs clustering recursively in a top-down manner. We propose an effective greedy splitting criteria for selecting which cluster to split next, and employ regularizers that enforce feature sharing/competition for capturing data semantics. Exp...
متن کاملA Maximum - Likelihood Approach
This paper presents a novel framework, based on maximum likelihood, for training models to recognise simple spatial-motion events, such as those described by the verbs pick up, put down, push, pull, drop, and throw, and classifying novel observations into previously trained classes. The model that we employ does not presuppose prior recognition or tracking of 3D object pose, shape, or identity....
متن کاملVibroseis Deconvolution with Maximum Likelihood Approach
The most commonly used deconvolution (Decon) method is based on minimum-phase assumption for the wavelet which is often not valid. Explosive energy source is close to minimum-phase which makes seismic data with explosive somewhat amenable to predictive Decon though the result is imperfect in phase. Decon of Vibroseis data is more problematic because the wavelet in a correlated Vibroseis trace i...
متن کاملActive Community Detection: A Maximum Likelihood Approach
We propose novel semi-supervised and active learning algorithms for the problem of community detection on networks. The algorithms are based on optimizing the likelihood function of the community assignments given a graph and an estimate of the statistical model that generated it. The optimization framework is inspired by prior work on the unsupervised community detection problem in Stochastic ...
متن کاملMaximum Likelihood Markov Networks: An Algorithmic Approach
We show how a graphical model learning problem can be presented as a purely combinatorial problem. This allows us to analyze the computational hardness of the learning problem, and devise global optimization algorithms with proven performance guarantees. Markov networks are a class of graphical models that use an undirected graph to capture dependency information among random variables. Of part...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Biomedical Engineering
سال: 2017
ISSN: 0018-9294,1558-2531
DOI: 10.1109/tbme.2016.2542212