scholarly journals A FRAMEWORK FOR COMMUNITY DETECTION IN HETEROGENEOUS MULTI-RELATIONAL NETWORKS

2014 ◽  
Vol 17 (06) ◽  
pp. 1450018 ◽  
Author(s):  
XIN LIU ◽  
WEICHU LIU ◽  
TSUYOSHI MURATA ◽  
KEN WAKITA
Keyword(s):  
Community Detection ◽  
Real World ◽  
State Of The Art ◽  
General Structure ◽  
The State ◽  
New Method ◽  
World Systems ◽  
Relational Networks ◽  
Relational Network ◽  
Art Techniques

There has been a surge of interest in community detection in homogeneous single-relational networks which contain only one type of nodes and edges. However, many real-world systems are naturally described as heterogeneous multi-relational networks which contain multiple types of nodes and edges. In this paper, we propose a new method for detecting communities in such networks. Our method is based on optimizing the composite modularity, which is a new modularity proposed for evaluating partitions of a heterogeneous multi-relational network into communities. Our method is parameter-free, scalable, and suitable for various networks with general structure. We demonstrate that it outperforms the state-of-the-art techniques in detecting pre-planted communities in synthetic networks. Applied to a real-world Digg network, it successfully detects meaningful communities.

scholarly journals Enumerating Maximal k-Plexes with Worst-Case Time Guarantee

2020 ◽  
Vol 34 (03) ◽  
pp. 2442-2449
Author(s):  
Yi Zhou ◽  
Jingwei Xu ◽  
Zhenyu Guo ◽  
Mingyu Xiao ◽  
Yan Jin
Keyword(s):  
Community Detection ◽  
Real World ◽  
State Of The Art ◽  
Real Life ◽  
The State ◽  
Enumeration Algorithm ◽  
Worst Case ◽  
Running Time ◽  
Real World Applications ◽  
First Time

The problem of enumerating all maximal cliques in a graph is a key primitive in a variety of real-world applications such as community detection and so on. However, in practice, communities are rarely formed as cliques due to data noise. Hence, k-plex, a subgraph in which any vertex is adjacent to all but at most k vertices, is introduced as a relaxation of clique. In this paper, we investigate the problem of enumerating all maximal k-plexes and present FaPlexen, an enumeration algorithm which integrates the “pivot” heuristic and new branching schemes. To our best knowledge, for the first time, FaPlexen lists all maximal k-plexes with provably worst-case running time O(n2γn) in a graph with n vertices, where γ < 2. Then, we propose another algorithm CommuPlex which non-trivially extends FaPlexen to find all maximal k-plexes of prescribed size for community detection in massive real-life networks. We finally carry out experiments on both real and synthetic graphs and demonstrate that our algorithms run much faster than the state-of-the-art algorithms.

scholarly journals Coinductive Algorithms for Büchi Automata

2021 ◽  
Vol 180 (4) ◽  
pp. 351-373
Author(s):  
Denis Kuperberg ◽  
Laureline Pinault ◽  
Damien Pous
Keyword(s):  
State Space ◽  
State Of The Art ◽  
The State ◽  
Specific Structure ◽  
Büchi Automata ◽  
Deterministic Automata ◽  
Buchi Automata ◽  
Language Equivalence ◽  
Art Techniques

We propose a new algorithm for checking language equivalence of non-deterministic Büchi automata. We start from a construction proposed by Calbrix, Nivat and Podelski, which makes it possible to reduce the problem to that of checking equivalence of automata on finite words. Although this construction generates large and highly non-deterministic automata, we show how to exploit their specific structure and apply state-of-the art techniques based on coinduction to reduce the state-space that has to be explored. Doing so, we obtain algorithms which do not require full determinisation or complementation.

scholarly journals HyP-ABC: A Novel Automated Hyper-Parameter Tuning Algorithm Using Evolutionary Optimization

2021 ◽  
Author(s):  
Leila Zahedi ◽  
Farid Ghareh Mohammadi ◽  
M. Hadi Amini
Keyword(s):  
Parameter Optimization ◽  
Real World ◽  
Optimization Problems ◽  
State Of The Art ◽  
Parameter Tuning ◽  
Gradient Boosting ◽  
Support Vector ◽  
Wide Range ◽  
Extreme Gradient Boosting ◽  
Art Techniques

Machine learning techniques lend themselves as promising decision-making and analytic tools in a wide range of applications. Different ML algorithms have various hyper-parameters. In order to tailor an ML model towards a specific application, a large number of hyper-parameters should be tuned. Tuning the hyper-parameters directly affects the performance (accuracy and run-time). However, for large-scale search spaces, efficiently exploring the ample number of combinations of hyper-parameters is computationally challenging. Existing automated hyper-parameter tuning techniques suffer from high time complexity. In this paper, we propose HyP-ABC, an automatic innovative hybrid hyper-parameter optimization algorithm using the modified artificial bee colony approach, to measure the classification accuracy of three ML algorithms, namely random forest, extreme gradient boosting, and support vector machine. Compared to the state-of-the-art techniques, HyP-ABC is more efficient and has a limited number of parameters to be tuned, making it worthwhile for real-world hyper-parameter optimization problems. We further compare our proposed HyP-ABC algorithm with state-of-the-art techniques. In order to ensure the robustness of the proposed method, the algorithm takes a wide range of feasible hyper-parameter values, and is tested using a real-world educational dataset.

scholarly journals A Review and Comparison of the State-of-the-Art Techniques for Atrial Fibrillation Detection and Skin Hydration

2021 ◽  
Vol 2 ◽  
Author(s):  
Sidrah Liaqat ◽  
Kia Dashtipour ◽  
Adnan Zahid ◽  
Kamran Arshad ◽  
Sana Ullah Jan ◽  
...  
Keyword(s):  
Atrial Fibrillation ◽  
State Of The Art ◽  
The State ◽  
Skin Hydration ◽  
Hydration Level ◽  
Independent Review ◽  
Intelligent Models ◽  
Electrocardiogram Ecg ◽  
Fast Heart Rate ◽  
Art Techniques

Atrial fibrillation (AF) is one of the most common types of cardiac arrhythmia, with a prevalence of 1–2% in the community, increasing the risk of stroke and myocardial infarction. Early detection of AF, typically causing an irregular and abnormally fast heart rate, can help reduce the risk of strokes that are more common among older people. Intelligent models capable of automatic detection of AF in its earliest possible stages can improve the early diagnosis and treatment. Luckily, this can be made possible with the information about the heart's rhythm and electrical activity provided through electrocardiogram (ECG) and the decision-making machine learning-based autonomous models. In addition, AF has a direct impact on the skin hydration level and, hence, can be used as a measure for detection. In this paper, we present an independent review along with a comparative analysis of the state-of-the-art techniques proposed for AF detection using ECG and skin hydration levels. This paper also highlights the effects of AF on skin hydration level that is missing in most of the previous studies.

scholarly journals Lossless Image Compression Techniques: A State-of-the-Art Survey

Symmetry ◽  
2019 ◽  
Vol 11 (10) ◽  
pp. 1274 ◽  
Author(s):  
Md. Atiqur Rahman ◽  
Mohamed Hamada
Keyword(s):  
Image Compression ◽  
High Speed ◽  
Communication Theory ◽  
State Of The Art ◽  
Signal To Noise Ratio ◽  
Daily Basis ◽  
The State ◽  
Huge Amount ◽  
Lossless Image Compression ◽  
Art Techniques

Modern daily life activities result in a huge amount of data, which creates a big challenge for storing and communicating them. As an example, hospitals produce a huge amount of data on a daily basis, which makes a big challenge to store it in a limited storage or to communicate them through the restricted bandwidth over the Internet. Therefore, there is an increasing demand for more research in data compression and communication theory to deal with such challenges. Such research responds to the requirements of data transmission at high speed over networks. In this paper, we focus on deep analysis of the most common techniques in image compression. We present a detailed analysis of run-length, entropy and dictionary based lossless image compression algorithms with a common numeric example for a clear comparison. Following that, the state-of-the-art techniques are discussed based on some bench-marked images. Finally, we use standard metrics such as average code length (ACL), compression ratio (CR), pick signal-to-noise ratio (PSNR), efficiency, encoding time (ET) and decoding time (DT) in order to measure the performance of the state-of-the-art techniques.

scholarly journals Particle Swarm Contour Search Algorithm

Entropy ◽  
2020 ◽  
Vol 22 (4) ◽  
pp. 407 ◽  
Author(s):  
Dominik Weikert ◽  
Sebastian Mai ◽  
Sanaz Mostaghim
Keyword(s):  
Image Processing ◽  
Real World ◽  
State Of The Art ◽  
Search Algorithm ◽  
Particle Swarm ◽  
Search Space ◽  
Local Information ◽  
The State ◽  
Complete Knowledge ◽  
Real World Applications

In this article, we present a new algorithm called Particle Swarm Contour Search (PSCS)—a Particle Swarm Optimisation inspired algorithm to find object contours in 2D environments. Currently, most contour-finding algorithms are based on image processing and require a complete overview of the search space in which the contour is to be found. However, for real-world applications this would require a complete knowledge about the search space, which may not be always feasible or possible. The proposed algorithm removes this requirement and is only based on the local information of the particles to accurately identify a contour. Particles search for the contour of an object and then traverse alongside using their known information about positions in- and out-side of the object. Our experiments show that the proposed PSCS algorithm can deliver comparable results as the state-of-the-art.

Community detection via closure extension

2018 ◽  
Vol 29 (12) ◽  
pp. 1850119
Author(s):  
Jingming Zhang ◽  
Jianjun Cheng ◽  
Xiaosu Feng ◽  
Xiaoyun Chen
Keyword(s):  
Community Structure ◽  
Computational Complexity ◽  
Community Detection ◽  
Network Structure ◽  
Real World ◽  
Prior Information ◽  
State Of The Art ◽  
Local Information ◽  
Second Step ◽  
Novel Method

Identifying community structure in networks plays an important role in understanding the network structure and analyzing the network features. Many state-of-the-art algorithms have been proposed to identify the community structure in networks. In this paper, we propose a novel method based on closure extension; it performs in two steps. The first step uses the similarity closure or correlation closure to find the initial community structure. In the second step, we merge the initial communities using Modularity [Formula: see text]. The proposed method does not need any prior information such as the number or sizes of communities, and it is able to obtain the same resulting communities in multiple runs. Moreover, it is noteworthy that our method has low computational complexity because of considering only local information of network. Some real-world and synthetic graphs are used to test the performance of the proposed method. The results demonstrate that our method can detect deterministic and informative community structure in most cases.

Performance and trends in recent opinion retrieval techniques

2013 ◽  
Vol 30 (1) ◽  
pp. 76-105 ◽  
Author(s):  
Sylvester O. Orimaye ◽  
Saadat M. Alhashmi ◽  
Eu-Gene Siew
Keyword(s):  
State Of The Art ◽  
Performance Comparison ◽  
The State ◽  
Future Research ◽  
Research Directions ◽  
Opinion Retrieval ◽  
Future Research Directions ◽  
And Performance ◽  
Comparison Table ◽  
Art Techniques

AbstractThis paper presents trends and performance of opinion retrieval techniques proposed within the last 8 years. We identify major techniques in opinion retrieval and group them into four popular categories. We describe the state-of-the-art techniques for each category and emphasize on their performance and limitations. We then summarize with a performance comparison table for the techniques on different datasets. Finally, we highlight possible future research directions that can help solve existing challenges in opinion retrieval.

scholarly journals Better Prediction of Mutation Score

2021 ◽  
Author(s):  
Yossi Gil ◽  
Dor Ma’ayan
Keyword(s):  
Neural Networks ◽  
Real World ◽  
State Of The Art ◽  
Future Research ◽  
World Systems ◽  
Reliable Measurement ◽  
Mutation Score ◽  
Class Level ◽  
Effectiveness Prediction ◽  
Better Than

<div><div><div><p>Mutation score is widely accepted to be a reliable measurement for the effectiveness of software tests. Recent studies, however, show that mutation analysis is extremely costly and hard to use in practice. We present a novel direct prediction model of mutation score using neural networks. Relying solely on static code features that do not require generation of mutants or execution of the tests, we predict mutation score with an accuracy better than a quintile. When we include statement coverage as a feature, our accuracy rises to about a decile. Using a similar approach, we also improve the state-of-the-art results for binary test effectiveness prediction and introduce an intuitive, easy-to-calculate set of features superior to previously studied sets. We also publish the largest dataset of test-class level mutation score and static code features data to date, for future research. Finally, we discuss how our approach could be integrated into real-world systems, IDEs, CI tools, and testing frameworks.</p></div></div></div>

scholarly journals Scene text removal via cascaded text stroke detection and erasing

2021 ◽  
Vol 8 (2) ◽  
pp. 273-287
Author(s):  
Xuewei Bian ◽  
Chaoqun Wang ◽  
Weize Quan ◽  
Juntao Ye ◽  
Xiaopeng Zhang ◽  
...  
Keyword(s):  
Performance Improvement ◽  
Real World ◽  
Large Scale ◽  
State Of The Art ◽  
The State ◽  
Experimental Results ◽  
Processing Unit ◽  
Final Model ◽  
Scene Text ◽  
End To End

AbstractRecent learning-based approaches show promising performance improvement for the scene text removal task but usually leave several remnants of text and provide visually unpleasant results. In this work, a novel end-to-end framework is proposed based on accurate text stroke detection. Specifically, the text removal problem is decoupled into text stroke detection and stroke removal; we design separate networks to solve these two subproblems, the latter being a generative network. These two networks are combined as a processing unit, which is cascaded to obtain our final model for text removal. Experimental results demonstrate that the proposed method substantially outperforms the state-of-the-art for locating and erasing scene text. A new large-scale real-world dataset with 12,120 images has been constructed and is being made available to facilitate research, as current publicly available datasets are mainly synthetic so cannot properly measure the performance of different methods.

Sign in / Sign up

Export Citation Format

Share Document