Figure 1 - uploaded by Wei Ye
Content may be subject to copyright.
Source publication
Graph clustering has been studied extensively on both plain graphs and attributed graphs. However, all these methods need to partition the whole graph to find cluster structures. Sometimes, based on domain knowledge, people may have information about a specific target region in the graph and only want to find a single cluster concentrated on this l...
Contexts in source publication
Context 1
... us use a simple example to demonstrate our motivation. Figure 1 shows an example social network, in which the vertices represent students in a middle school, the edges represent their friendship relations, and the attributes associated to each vertex are age (year), sport time (hour) per week, studying time (hour) per week and playing mobile game (M.G.) time (hour) per week. Given vertex 4 and the designated attribute M.G., the task is to find a local cluster around the vertex 4. (This task is of interest to mobile game producers.) ...
Context 2
... the seed vertex Jiawei Han and two attributes "data mining" and "machine learning", we want to find a local cluster concentrating on this seed vertex and the two designated attributes. Figure 10(a) shows the main component of the local cluster that includes the given seed vertex (in red) and the detected vertices (in blue) by LOCLU. This subgraph has 37 authors and is unimodal in the two designated attributes "data mining" and "machine learning". ...
Context 3
... Normality score is -2.000. Thus, the subgraph shown in Figure 10(a) has a higher quality than that shown in Figure 10(b). ...
Context 4
... Normality score is -2.000. Thus, the subgraph shown in Figure 10(a) has a higher quality than that shown in Figure 10(b). ...
Context 5
... us use a simple example to demonstrate our motivation. Figure 1 shows an example social network, in which the vertices represent students in a middle school, the edges represent their friendship relations, and the attributes associated to each vertex are age (year), sport time (hour) per week, studying time (hour) per week and playing mobile game (M.G.) time (hour) per week. Given vertex 4 and the designated attribute M.G., the task is to find a local cluster around the vertex 4. (This task is of interest to mobile game producers.) ...
Context 6
... the seed vertex Jiawei Han and two attributes "data mining" and "machine learning", we want to find a local cluster concentrating on this seed vertex and the two designated attributes. Figure 10(a) shows the main component of the local cluster that includes the given seed vertex (in red) and the detected vertices (in blue) by LOCLU. This subgraph has 37 authors and is unimodal in the two designated attributes "data mining" and "machine learning". ...
Context 7
... Normality score is -2.000. Thus, the subgraph shown in Figure 10(a) has a higher quality than that shown in Figure 10(b). ...
Similar publications
Maze is a place that has many paths with tortuous paths that are misleading and full of dead ends and can be viewed as a grid graph. A non-perfect maze is a maze that has a cycle. This research produces an algorithm that can form a non-perfect maze with a size of m×n which has two types of bias. The first bias is the composition of the percentage o...
![Adding edge e={5,8}\documentclass[12pt]{minimal} \usepackage{amsmath}...](profile/Irene-Sciriha/publication/343140741/figure/fig4/AS:1059108513910784@1629522555759/Adding-edge-e5-8documentclass12ptminimal-usepackageamsmath_Q320.jpg)
![Adding edge e={3,14}\documentclass[12pt]{minimal} \usepackage{amsmath}...](profile/Irene-Sciriha/publication/343140741/figure/fig5/AS:1059108518109184@1629522556273/Adding-edge-e3-14documentclass12ptminimal-usepackageamsmath_Q320.jpg)
The core vertex set of a graph is an invariant of the graph. It consists of those vertices associated with the non-zero entries of the nullspace vectors of a $$\{0,1\}$${0,1}-adjacency matrix. The remaining vertices of the graph form the core-forbidden vertex set. For graphs with independent core vertices, such as bipartite minimal configurations a...
Skolem mean labeling of Six star graphs under the condition 0 ≤ 1 is proved in this paper with clear explanation and examples. The aim of this paper is to discuss the 4, 2 partition of the Six star graph and to find the existence of the skolem mean labeling for the Six star graph under the given conditions with clear step by step proof.
Let G be a graph and let \(f_i, i \in \{1,\ldots ,s\},\) be a function from V(G) to the set of nonnegative integers. In Sittitrai and Nakprasit (Analogue of DP-coloring on variable degeneracy and its applications, 2020), the concept of DP-F-coloring, a generalization of DP-coloring and variable degeneracy, was introduced. We use DP-F-coloring to de...
![The graphs F1,F2\documentclass[12pt]{minimal} \usepackage{amsmath}...](publication/342012622/figure/fig1/AS:960093197713426@1605915464909/The-graphs-F1-F2documentclass12ptminimal-usepackageamsmath-usepackagewasysym_Q320.jpg)
![s′,t′,u′,w′\documentclass[12pt]{minimal} \usepackage{amsmath}...](publication/342012622/figure/fig2/AS:960093201920009@1605915465047/s-t-u-wdocumentclass12ptminimal-usepackageamsmath-usepackagewasysym_Q320.jpg)
![s′,t′,u′,w′\documentclass[12pt]{minimal} \usepackage{amsmath}...](publication/342012622/figure/fig3/AS:960093201891331@1605915465184/s-t-u-wdocumentclass12ptminimal-usepackageamsmath-usepackagewasysym_Q320.jpg)
![both s′\documentclass[12pt]{minimal} \usepackage{amsmath}...](publication/342012622/figure/fig4/AS:960093201911828@1605915465314/both-sdocumentclass12ptminimal-usepackageamsmath-usepackagewasysym_Q320.jpg)
![both t′\documentclass[12pt]{minimal} \usepackage{amsmath}...](publication/342012622/figure/fig5/AS:960093201891342@1605915465418/both-tdocumentclass12ptminimal-usepackageamsmath-usepackagewasysym_Q320.jpg)
A dominating set in a graph G is a set \(S\subseteq V(G)\) such that every vertex in \(V(G){\setminus } S\) has at least one neighbor in S. Let G be an arbitrary claw-free graph containing only vertices of degree two or three. In this paper, we prove that the vertex set of G can be partitioned into two dominating sets \(V_1\) and \(V_2\) such that...
