Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleNovember 2024
The weight balance function on trees
Discrete Applied Mathematics (DAMA), Volume 357, Issue CPages 66–73https://doi.org/10.1016/j.dam.2024.05.040AbstractBased on the work of Reid and DePalma (2005), a new type of location function on trees, called the weight balance function and denoted by W b, is introduced. We compare W b with the well known median function M e d and show that W b ( π ) ⊆ M e d ...
- research-articleAugust 2024JUST ACCEPTED
MalSensor: Fast and Robust Windows Malware Classification
ACM Transactions on Software Engineering and Methodology (TOSEM), Just Accepted https://doi.org/10.1145/3688833Driven by the substantial profits, the evolution of Portable Executable (PE) malware has posed persistent threats. PE malware classification has been an important research field, and numerous classification methods have been proposed. With the development ...
- research-articleNovember 2024
Purity: a New Dimension for Measuring Data Centralization Quality
ICCBDC '24: Proceedings of the 2024 8th International Conference on Cloud and Big Data ComputingPages 8–14https://doi.org/10.1145/3694860.3694862Data has become an asset for companies, originating from various sources, such as IoT paradigms. It is crucial to safeguard its life cycle using suitable, scalable, and effective technologies, like those enabled by cloud computing models. However, in ...
- research-articleJuly 2024
Improving linear orthogonal mapping based cross-lingual representation using ridge regression and graph centrality
AbstractOrthogonal linear mapping is a commonly used approach for generating cross-lingual embedding between two monolingual corpora that uses a word frequency-based seed dictionary alignment approach. While this approach is found to be effective for ...
Highlights- Orthogonal linear mapping performs poorly in cross-lingual embeddings of non-isomorphic languages.
- Correlation analysis in dictionary pairs shows better correlation in centrality than frequency.
- Centrality measure is more favorable ...
- research-articleJune 2024
A fusion of centrality and correlation for feature selection
Expert Systems with Applications: An International Journal (EXWA), Volume 241, Issue Chttps://doi.org/10.1016/j.eswa.2023.122548AbstractThe rapid development of computer and database technologies has led to the high growth of large-scale datasets. This produces an important issue for data mining applications called the curse of dimensionality, where the number of features is much ...
Highlights- A metric is proposed to measure the influence of features themselves.
- The new discriminant function is proposed to select the optimal feature subset.
- Our method can effectively reduce the dimensionality and computational ...
-
- research-articleApril 2024
Quantifying the progress of artificial intelligence subdomains using the patent citation network
Scientometrics (SPSCI), Volume 129, Issue 5Pages 2559–2581https://doi.org/10.1007/s11192-024-04996-3AbstractEven though Artificial Intelligence (AI) has been having a transformative effect on human life, there is currently no precise quantitative method for measuring and comparing the performance of different AI methods. Technology Improvement Rate (TIR)...
- research-articleFebruary 2024
Label propagation algorithm for community discovery based on centrality and common neighbours
The Journal of Supercomputing (JSCO), Volume 80, Issue 8Pages 11816–11842https://doi.org/10.1007/s11227-024-05904-5AbstractWe propose a label propagation-based algorithm to extract community structure using a new similarity measure based on centrality and common neighbours. Initially, a distinct label is assigned to each vertex. Along the process, each vertex adopts ...
- research-articleJanuary 2024
Central node identification via weighted kernel density estimation
Data Mining and Knowledge Discovery (DMKD), Volume 38, Issue 3Pages 1417–1439https://doi.org/10.1007/s10618-024-01003-4AbstractThe detection of central nodes in a network is a fundamental task in network science and graph data analysis. During the past decades, numerous centrality measures have been presented to characterize what is a central node. However, few studies ...
- research-articleFebruary 2024
H-sequences and 2-step coreness in graphs
Discrete Applied Mathematics (DAMA), Volume 343, Issue CPages 258–268https://doi.org/10.1016/j.dam.2023.11.007AbstractAn H-sequence of a vertex is defined by iteratively applying H-index to neighbors of the vertex in a graph. It is still not known whether changing the initial values affects the convergence of H-sequences. Our purpose is to investigate the ...
- research-articleNovember 2023
Contagion in social networks: On contagion thresholds
Applied Mathematics and Computation (APMC), Volume 456, Issue Chttps://doi.org/10.1016/j.amc.2023.128121Highlights- Two algorithms for computing the contagion threshold are presented.
- Contagion thresholds of connected sets of nodes in a tree are completely determined.
- Bounds for contagion thresholds of nodes in a general network are established.
Consider a story initiated by a set S of nodes belonging to a network. We assume that all the remaining nodes in the network have the same adoption threshold q such that each of them will accept the story if and only if the story has been ...
- research-articleSeptember 2023
A centrality based genetic algorithm for the graph burning problem
AbstractInformation spread is an intriguing topic to study in network science, which investigates how information, influence, or contagion propagate through networks. Graph burning is a simplified deterministic model for how information ...
Highlights- Graph burning is used in modeling, analysis of information spread in social networks
- research-articleJuly 2023
Enhancing attack resilience of cyber-physical systems through state dependency graph models
International Journal of Information Security (IJOIS), Volume 23, Issue 1Pages 187–198https://doi.org/10.1007/s10207-023-00731-wAbstractThis paper presents a method that utilizes graph theory and state modelling algorithms to perform automatic complexity analysis of the architecture of cyber-physical systems (CPS). It describes cyber physical systems risk assessment (CPSRA), a ...
- research-articleJuly 2023
Mining the Human Networks and Identification of Group Activities Using the Crime Scraping Engine
AbstractThis article proposes a model (Crime Scraping Engine) to identify human networks and group activities using the crime victim’s data. These activities can be related to crime networks or terror networks. The primary focus of this work is to ...
- research-articleApril 2023
Graph-based Approach for Studying Spread of Radical Online Sentiment
WWW '23 Companion: Companion Proceedings of the ACM Web Conference 2023Pages 1373–1380https://doi.org/10.1145/3543873.3587634The spread of radicalization through the Internet is a growing problem. We are witnessing a rise in online hate groups, inspiring the impressionable and vulnerable population towards extreme actions in the real world. In this paper, we study the spread ...
- research-articleMarch 2023
Analyzing and Comparing Omicron Lineage Variants Protein–Protein Interaction Network Using Centrality Measure
AbstractThe Worldwide spread of the Omicron lineage variants has now been confirmed. It is crucial to understand the process of cellular life and to discover new drugs need to identify the important proteins in a protein interaction network (PPIN). PPINs ...
- research-articleJanuary 2023
A Set of Measures of Centrality by Level for Social Network Analysis
Procedia Computer Science (PROCS), Volume 219, Issue CPages 751–758https://doi.org/10.1016/j.procs.2023.01.348AbstractSocial networks are becoming more indispensable in our lives, which leads researchers to seek to understand and analyze them. Social network analysis has become a specialty of sociology in network theory and graph theory as well. The principal ...
- research-articleDecember 2022
A parameterizable influence spread-based centrality measure for influential users detection in social networks
AbstractIn social network analysis, centrality refers to the relevance of actors or nodes within a social network represented as a graph. Traditional centrality measures are based on topological aspects of the network or the information flow ...
Highlights- We propose a new centrality measure based on influence spread models.
- This ...
- research-articleApril 2022
Temporal Walk Centrality: Ranking Nodes in Evolving Networks
WWW '22: Proceedings of the ACM Web Conference 2022Pages 1640–1650https://doi.org/10.1145/3485447.3512210We propose the Temporal Walk Centrality, which quantifies the importance of a node by measuring its ability to obtain and distribute information in a temporal network. In contrast to the widely-used betweenness centrality, we assume that information ...
- ArticleMarch 2022
Power in Networks: A PGI Analysis of Krackhardt’s Kite Network
Transactions on Computational Collective Intelligence XXXIVPages 21–34https://doi.org/10.1007/978-3-662-60555-4_2AbstractThis paper applies power index analysis to the well-known Krackhardt’s kite social network by imposing a weighted voting game on the given network structure. It compares the results of this analysis, derived by applying the Public Good Index and ...
- research-articleFebruary 2022
Automatic analysis of attack graphs for risk mitigation and prioritization on large-scale and complex networks in Industry 4.0
International Journal of Information Security (IJOIS), Volume 21, Issue 1Pages 37–59https://doi.org/10.1007/s10207-020-00533-4AbstractThreat models and attack graphs have been used more than 20 years by enterprises and organizations for mapping the actions of potential adversaries, analyzing the effects of vulnerabilities and visualizing attack scenarios. Although efficient when ...