Local Edge Betweenness based Label Propagation for Community Detection in Complex Networks

Nowadays, identification and detection community structures in complex networks is an important factor in extracting useful information from networks. Label propagation algorithm with near linear-time complexity is one of the most popular methods for detecting community structures, yet its uncertainty and randomness is a defective factor. Merging LPA with other community detection metrics would improve its accuracy and reduce instability of LPA. Considering this point, in this paper we tried to use edge betweenness centrality to improve LPA performance. On the other hand, calculating edge betweenness centrality is expensive, so as an alternative metric, we try to use local edge betweenness and present LPA-LEB (Label Propagation Algorithm Local Edge Betweenness). Experimental results on both real-world and benchmark networks show that LPA-LEB possesses higher accuracy and stability than LPA when detecting community structures in networks.Comment: 6 page

A Novel Approach to Finding Near-Cliques: The Triangle-Densest Subgraph Problem

Many graph mining applications rely on detecting subgraphs which are near-cliques. There exists a dichotomy between the results in the existing work related to this problem: on the one hand the densest subgraph problem (DSP) which maximizes the average degree over all subgraphs is solvable in polynomial time but for many networks fails to find subgraphs which are near-cliques. On the other hand, formulations that are geared towards finding near-cliques are NP-hard and frequently inapproximable due to connections with the Maximum Clique problem. In this work, we propose a formulation which combines the best of both worlds: it is solvable in polynomial time and finds near-cliques when the DSP fails. Surprisingly, our formulation is a simple variation of the DSP. Specifically, we define the triangle densest subgraph problem (TDSP): given $G(V,E)$, find a subset of vertices $S^*$ such that $\tau(S^*)=\max_{S \subseteq V} \frac{t(S)}{|S|}$, where $t(S)$ is the number of triangles induced by the set $S$. We provide various exact and approximation algorithms which the solve the TDSP efficiently. Furthermore, we show how our algorithms adapt to the more general problem of maximizing the $k$-clique average density. Finally, we provide empirical evidence that the TDSP should be used whenever the output of the DSP fails to output a near-clique.Comment: 42 page

Automatic Wrapper Adaptation by Tree Edit Distance Matching

Information distributed through the Web keeps growing faster day by day,\ud and for this reason, several techniques for extracting Web data have been suggested\ud during last years. Often, extraction tasks are performed through so called wrappers,\ud procedures extracting information from Web pages, e.g. implementing logic-based\ud techniques. Many fields of application today require a strong degree of robustness\ud of wrappers, in order not to compromise assets of information or reliability of data\ud extracted.\ud Unfortunately, wrappers may fail in the task of extracting data from a Web page, if\ud its structure changes, sometimes even slightly, thus requiring the exploiting of new\ud techniques to be automatically held so as to adapt the wrapper to the new structure\ud of the page, in case of failure. In this work we present a novel approach of automatic wrapper adaptation based on the measurement of similarity of trees through\ud improved tree edit distance matching techniques

Remote sensing of tidal networks and their relation to vegetation

The study of the morphology of tidal networks and their relation to salt marsh vegetation is currently an active area of research, and a number of theories have been developed which require validation using extensive observations. Conventional methods of measuring networks and associated vegetation can be cumbersome and subjective. Recent advances in remote sensing techniques mean that these can now often reduce measurement effort whilst at the same time increasing measurement scale. The status of remote sensing of tidal networks and their relation to vegetation is reviewed. The measurement of network planforms and their associated variables is possible to sufficient resolution using digital aerial photography and airborne scanning laser altimetry (LiDAR), with LiDAR also being able to measure channel depths. A multi-level knowledge-based technique is described to extract networks from LiDAR in a semi-automated fashion. This allows objective and detailed geomorphological information on networks to be obtained over large areas of the inter-tidal zone. It is illustrated using LIDAR data of the River Ems, Germany, the Venice lagoon, and Carnforth Marsh, Morecambe Bay, UK. Examples of geomorphological variables of networks extracted from LiDAR data are given. Associated marsh vegetation can be classified into its component species using airborne hyperspectral and satellite multispectral data. Other potential applications of remote sensing for network studies include determining spatial relationships between networks and vegetation, measuring marsh platform vegetation roughness, in-channel velocities and sediment processes, studying salt pans, and for marsh restoration schemes