One solution to process and analysis of massive graphs is summarization. Generating a high quality summary is the main challenge of graph summarization. In the aims of generating a summary with a better quality for a given attributed graph, both structural and attribute similarities must be considered. There are two measures named density and entropy to evaluate the quality of structural and at...

abstract in this research sand drifts potential using sand rose graph software and fryberger velocity classes’ method investigated. thus wind data between 1985 and 2005 from meteorological stations of jask and kerman were analyzed to examine sand drift potential. sand drift potential amount of kerman station was 412.6 using sand rose graph and 401.09 using fryberger,s method. sand drift potenti...

Abstract As the number of graph-level embedding techniques increases at an unprecedented speed, questions arise about their behavior and performance when training data undergo perturbations. This is case external entity maliciously alters to invalidate embedding. paper explores effects such attacks on some graph datasets by applying different techniques. The main attack strategy involves manipu...

Online social networks (OSNs) are threatened by Sybil attacks, which create fake accounts (also called Sybils) on OSNs and use them for various malicious activities. Therefore, detection is a fundamental task OSN security. Most existing methods based the graph structure of OSNs, have been proposed recently. However, although almost all compared experimentally in terms performance noise robustne...

Many well-established anomaly detection methods use the distance of a sample to those in its local neighbourhood: so-called `local outlier methods', such as LOF and DBSCAN. They are popular for their simple principles strong performance on unstructured, feature-based data that is commonplace many practical applications. However, they cannot learn adapt particular set due lack trainable paramete...