Results 231 to 240 of about 242,831 (264)
Some of the next articles are maybe not open access.
A clustering coefficient for complete weighted networks
Network Science, 2015AbstractThe clustering coefficient is typically used as a measure of the prevalence of node clusters in a network. Various definitions for this measure have been proposed for the cases of networks having weighted edges which may or not be directed. However, these techniques consistently assume that only a subset of all possible edges is present in the ...
Bijma, F., Mc Assey, M.P.
openaire +3 more sources
Clustering Coefficients of Random Intersection Graphs
2012Two general random intersection graph models (active and passive) were introduced by Godehardt and Jaworski (Exploratory Data Analysis in Empirical Research, Springer, Berlin, Heidelberg, New York, pp.68–81, 2002). Recently the models have been shown to have wide real life applications. The two most important ones are: non-metric data analysis and real
Erhard Godehardt +2 more
openaire +2 more sources
From Water Clustering to Osmotic Coefficients
The Journal of Physical Chemistry A, 2010Water activity is an important macroscopic property of aerosol particles and droplets in the atmosphere as well as aqueous solutions in many other fields of physical chemistry. This study focuses on relating water activity, described using osmotic coefficients, to the microscopic water structure in systems of atmospheric relevance, namely, aqueous ...
Frosch , Mia +2 more
openaire +2 more sources
Computing node clustering coefficients securely
Proceedings of the 2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2019When performing any analysis task, some information may be leaked or scattered among individuals who may not willing to share their information (e.g., number of individual's friends and who they are). Secure multi-party computation (MPC) allows individuals to jointly perform any computation without revealing each individual's input.
Katchaguy Areekijseree +2 more
openaire +2 more sources
Comparison of Similarity Coefficients for Clustering and Compound Selection
Journal of Chemical Information and Modeling, 2008Recent studies into the use of a selection of similarity coefficients, when applied to searches of chemical databases represented by binary fingerprints, have shown considerable variation in their retrieval performance and in the sets of compounds being retrieved. The main factor influencing performance is the density distribution of the bitstrings for
Maciej Haranczyk, John D. Holliday
openaire +3 more sources
Approximate Triangle Count and Clustering Coefficient
Proceedings of the 2018 International Conference on Management of Data, 2018Two important metrics used to characterise a graph are its triangle count and clustering coefficient. In this paper, we present methods to approximate these metrics for graphs.
openaire +2 more sources
Clustering coefficients of growing networks
Physica A: Statistical Mechanics and its Applications, 2007Abstract In this paper, we develop a general analytical method to compute clustering coefficients of growing networks. This method can be applied to any network as long as we can construct and solve the dynamic equation for the degree of any node. We also verify the accuracy of the method through simulation.
Shi, Dinghua +2 more
openaire +2 more sources
Robustness of clustering coefficients
Communications in Statistics - Theory and Methods, 2023Xiaofeng Zhao, Mingao Yuan
openaire +1 more source
Clustering function: another view on clustering coefficient
Journal of Complex Networks, 2015Mindaugas Bloznelis, Valentas Kurauskas
openaire +1 more source
Data clustering: application and trends
Artificial Intelligence Review, 2022Gbeminiyi Oyewole, George Alex Thopil
exaly