Multi-training sensor networks with bipartite conflict graphs by Ishak, Ruzana, Olariu, Stephan, Salleh, Shahruddin

“…The corresponding task is referred to as multi-training.The main contribution of this work is to show that in case the conflict graphs of the AFN coverage is bipartite, multi-training can be completed very fast by a simple algorithm. …”
Get full text

Process flexibility revisited : the graph expander and its applications by Chou, Mabel C., Chua, Geoffrey A., Teo, Chung-Piaw, Zheng, Huan

“…We argue that good flexible process structures are essentially highly connected graphs, and we use the concept of graph expansion (a measure of graph connectivity) to achieve various insights into this design problem. …”
Get full text
Get full text

Efficient and scalable techniques for pagerank-based graph analytics by Yang, Renchi

“…However, existing solutions for computing HKPR either are prohibitively expensive or provide unsatisfactory error approximation on HKPR values, rendering them impractical especially on billion-edge graphs. Thus, we present TEA and TEA+, which utilize deterministic graph traversal to produce a rough estimation of the exact HKPR vector, and then exploit Monte-Carlo random walks to refine the results in an optimized and non-trivial way. …”
Get full text

Approximate personalized propagation for unsupervised embedding in heterogeneous graphs by Chen, Yibi, Hu, Yikun, Li, Keqin, Yeo, Chai Kiat, Li, Kenli

“…Additionally, we improve the robustness and generalization ability of model, employing throwedge to increase the randomness and diversity of the graph connections by randomly deleting a part of edges. …”
Get full text

Functional graphs and their applications in generic attacks on iterated hash constructions by Bao, Zhenzhen, Wang, Lei, Guo, Jian

“…We look into attacks involving iteratively evaluating identical mappings many times. The functional graph of a random mapping also involves iteratively evaluating the mapping. …”
Get full text
Get full text

MASALAH PARTISI GRAF BOTTLENECK (BOTTLENECK GRAPH PARTITION PROBLEM) by Perpustakaan UGM, i-lib

“…On validation the random graph is used for the computer's program. …”

Graph coloring applied to secure computation in non-Abelian groups by Yao, Andrew Chi-Chih, Wang, Huaxiong, Desmedt, Yvo, Pieprzyk, Josef, Steinfeld, Ron, Sun, Xiaoming, Tartary, Christophe

“…We reduce the problem of constructing such protocols to a combinatorial coloring problem in planar graphs. We then give three constructions for such colorings. …”
Get full text
Get full text

Optimizing Diabetes Cupping Point from Graph Colouring Perspective by Nur Atikah, Aziz, Yusof, Yuhani, Hazulin, Mohd Radzuan, Noviantri, Viska

“…This paper proposes a graph model to identify the optimal number of cupping points for diabetes using a graph colouring approach based on the perspective of human nerves.…”
Get full text

Types of student errors in mathematical symbols, graphs and problem-solving by Veloo, Arsaythamby, Krishnasamy, Hariharan N., Wan Abdullah, Wan Shahida

“…This study aims to identify the level of difficulty, discrimination and errors based on symbols, graphs and problem-solving in mathematics achievement.The participants consisted of 315 grade 10 students randomly selected from eight secondary day schools situated in the state of Kedah, Malaysia.The mathematics written test consisted of 15 open-ended items with five items each for symbols, graphs and problem-solving and all the items were analyzed using the difficulty and discrimination index.Semi-structured clinical interviews were also carried out among 20 selected students to identify the errors they had made in mathematics. …”
Get full text

Random walk strategies in information network representation learning by Zhou, Xuwen

“…However, most of the real-world networks are Heterogeneous Information Network (HIN), a graph containing different types of nodes and links. …”
Get full text

Graph-based point-of-interest recommendation on location-based social networks by Guo, Qing

“…Specifically, a meta-path based random walk over a novel knowledge graph is proposed to discover POI neighbors based on the heterogeneous factors. …”
Get full text
Get full text

Data mining technique on Cardioid graph based ECG biometric authentication by Sidek, Khairul Azami, Sufi, Fahim, Khalil, Ibrahim

“…However, existing research suffers from lower accuracy due to random biometric template selection from fixed points in Cartesian coordinate. …”
Get full text

Application of graph convolutional neural networks to Alzheimer's and Parkinson's disease classification by Goli, Haveesh

“…Furthermore, we propose an ensemble learning strategy for training multiple instances of pGCN as random graph embeddings and demonstrate improved classification performance. …”
Get full text

Graph signal processing over a probability space of shift operators by Ji, Feng, Tay, Wee Peng, Ortega, Antonio

“…The shift operator is often chosen to capture the graph topology. However, in many applications, the graph topology may be unknown a priori, its structure uncertain, or generated randomly from a predefined set for each observation. …”
Get full text

An Entropy-Based Directed Random Walk for Cancer Classification Using Gene Expression Data Based on Bi-Random Walk on Two Separated Networks by Xin Hui Tay, Xin Hui Tay, Kasim, Shahreen, Tole Sutikno, Tole Sutikno, Md Fudzee, Mohd Farhan, Hassan, Rohayanti, Emelia Akashah Patah Akhir, Emelia Akashah Patah Akhir, Aziz, Norshakirah, Choon Sen Seah, Choon Sen Seah

“…This study proposed an entropy-based directed random walk (e-DRW) method to infer pathway activities. …”
Get full text

An Entropy-Based Directed Random Walk for Cancer Classification Using Gene Expression Data Based on Bi-Random Walk on Two Separated Networks by Tay, Xin Hui, Kasim, Shahreen, Sutikno, Tole, Md Fudzee, Mohd Farhan, Hassan, Rohayanti, Patah Akhir, Emelia Akashah, Aziz, Norshakirah, Seah, Choon Sen

“…This study proposed an entropy-based directed random walk (e-DRW) method to infer pathway activities. …”
Get full text

An Entropy-Based Directed Random Walk for Cancer Classification Using Gene Expression Data Based on Bi-Random Walk on Two Separated Networks by Xin Hui Tay, Xin Hui Tay, Shahreen Kasim, Shahreen Kasim, Tole Sutikno, Tole Sutikno, Md Fudzee, Mohd Farhan, Hassan, Rohayanti, Patah Akhir, Emelia Akashah, Aziz, Norshakirah, Choon Sen Seah, Choon Sen Seah

“…This study proposed an entropy-based directed random walk (e-DRW) method to infer pathway activities. …”
Get full text

Fusing topology contexts and logical rules in language models for knowledge graph completion by Lin, Qika, Mao, Rui, Liu, Jun, Xu, Fangzhi, Cambria, Erik

“…Knowledge graph completion (KGC) aims to infer missing facts based on the observed ones, which is significant for many downstream applications. …”
Get full text

Graph-based tracing of filamentary structured objects with applications in neuronal and retinal images by De, Jaydeep

“…The label propagation problem can also be formulated as a random walk on an Absorbing Markov Chain (AMC). After converting the original graph into an AMC, the Fundamental Matrix is computed, which is the expected number of visits from one node to another before absorption. …”
Get full text

Taxi-speed prediction by spatio-temporal graph-based trajectory representation and its applications by Tran, Thanh-Nam, Pham, Duc-Thinh, Alam, Sameer, Duong, Vu

“…The Random Forest algorithm is selected as our predictive model. …”
Get full text