Mixtures of Radial Densities for Clustering Graphs

نویسنده

  • Brijnesh J. Jain
چکیده

We address the problem of unsupervised learning on graphs. The contribution is twofold: (1) we propose an EM algorithm for estimating the parameters of a mixture of radial densities on graphs on the basis of the graph orbifold framework; and (2) we compare orbifold-based clustering algorithms including the proposed EM algorithm against stateof-the-art methods based on pairwise dissimilarities. The results show that orbifold-based clustering methods complement the existing arsenal of clustering methods on graphs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Compressed Liquid Densities for Binary Mixtures at Temperatures from 280- 440K at Pressures up to 200 MPa

A method for predicting liquid densities of binary mixtures from heat of vaporization and liquid densityat boiling point temperature (ΔHvap and n b ρ ) as scaling constants, is presented. B2(T) follows a promisingcorresponding-states principle. Calculation of α(T) and b(T), the two other temperature-dependentconstants of the equation of state, are made possible by scaling. As a result ΔHvap and...

متن کامل

An Analytical Equation of State for Saturated Liquid Refrigerant Ternary Mixtures

In this work an analytical equation of state has been employed to calculate the PVT properties ofternary refrigerant mixtures. The theoretical EoS is that of Ihm, Song and Mason, which is based onstatistical-mechanical perturbation theory, and the two constants are enthalpy of vaporization ΔHvapand molar density ρnb, both at the normal boiling temperature. The following three temperaturedepende...

متن کامل

Graph Clustering by Hierarchical Singular Value Decomposition with Selectable Range for Number of Clusters Members

Graphs have so many applications in real world problems. When we deal with huge volume of data, analyzing data is difficult or sometimes impossible. In big data problems, clustering data is a useful tool for data analysis. Singular value decomposition(SVD) is one of the best algorithms for clustering graph but we do not have any choice to select the number of clusters and the number of members ...

متن کامل

Maximum likelihood method for parameter estimation of bell-shaped functions on graphs

To estimate the location-scale parameters of a bell-shaped density on attributed graphs, we consider radial densities as approximations. The problem of estimating the parameters of radial densities on graphs is equivalent to the problem of estimating the parameters of truncated Gaussians in a Euclidean space. Based on this result, we adopt the maximum likelihood method for truncated Gaussians. ...

متن کامل

Finding Community Base on Web Graph Clustering

Search Pointers organize the main part of the application on the Internet. However, because of Information management hardware, high volume of data and word similarities in different fields the most answers to the user s’ questions aren`t correct. So the web graph clustering and cluster placement in corresponding answers helps user to achieve his or her intended results. Community (web communit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013