40 resultados para Graph spectra
Resumo:
Graph matching is an important class of methods in pattern recognition. Typically, a graph representing an unknown pattern is matched with a database of models. If the database of model graphs is large, an additional factor in induced into the overall complexity of the matching process. Various techniques for reducing the influence of this additional factor have been described in the literature. In this paper we propose to extract simple features from a graph and use them to eliminate candidate graphs from the database. The most powerful set of features and a decision tree useful for candidate elimination are found by means of the C4.5 algorithm, which was originally proposed for inductive learning of classication rules. Experimental results are reported demonstrating that effcient candidate elimination can be achieved by the proposed procedure.
Resumo:
The high-pressure behavior of scandium oxide (Sc2O3) has been investigated by angle-dispersive synchrotron powder X-ray diffraction and Raman spectroscopy techniques in a diamond anvil cell up to 46.2 and 42 GPa, respectively. An irreversible structural transformation of Sc2O3 from the cubic phase to a monoclinic high-pressure phase was observed at 36 GPa. Subsequent ab initio calculations for Sc2O3 predicted the phase transition from the cubic to monoclinic phase but at a much lower pressure. The same calculations predicted a second phase transition at 77 GPa from the monoclinic to hexagonal phase.
Resumo:
Facebook disseminates messages for billions of users everyday. Though there are log files stored on central servers, law enforcement agencies outside of the U.S. cannot easily acquire server log files from Facebook. This work models Facebook user groups by using a random graph model. Our aim is to facilitate detectives quickly estimating the size of a Facebook group with which a suspect is involved. We estimate this group size according to the number of immediate friends and the number of extended friends which are usually accessible by the public. We plot and examine UML diagrams to describe Facebook functions. Our experimental results show that asymmetric Facebook friendship fulfills the assumption of applying random graph models.
Resumo:
To protect from privacy disclosure, the social network graph is modified in order to hide the information that potentially be used to disclose person's identity. However, when the social network graph is changed, it is a great challenge to balance between the privacy gained and the loss of data utility. In this paper, we address this problem. We propose a new graph topological-based metric to improve utility preservation in social network graph anonymization. We compare the proposed approach with the amount-of-edge-change metric that popularly used in most of previous works. Experimental evaluation shows that our approach generates anonymized social network with improved utility preservation.