Pub Date : 2023-07-27DOI: 10.1142/s0219265923500135
Zhiqiang Ma, Fengyun Ren, Meiqin Wei, Gemaji Bao
For a family of connected graphs [Formula: see text], a spanning subgraph [Formula: see text] of [Formula: see text] is called an [Formula: see text]-factor if each component of [Formula: see text] is isomorphic to a member of [Formula: see text]. In this paper, sufficient conditions with regard to tight toughness, isolated toughness and binding number bounds to guarantee the existence of the [Formula: see text]-factor, [Formula: see text]-factor or [Formula: see text]-factor for [Formula: see text] are obtained.
{"title":"Sufficient Conditions of (Isolated) Toughness and Binding Number for the Existence of Component Factors","authors":"Zhiqiang Ma, Fengyun Ren, Meiqin Wei, Gemaji Bao","doi":"10.1142/s0219265923500135","DOIUrl":"https://doi.org/10.1142/s0219265923500135","url":null,"abstract":"For a family of connected graphs [Formula: see text], a spanning subgraph [Formula: see text] of [Formula: see text] is called an [Formula: see text]-factor if each component of [Formula: see text] is isomorphic to a member of [Formula: see text]. In this paper, sufficient conditions with regard to tight toughness, isolated toughness and binding number bounds to guarantee the existence of the [Formula: see text]-factor, [Formula: see text]-factor or [Formula: see text]-factor for [Formula: see text] are obtained.","PeriodicalId":53990,"journal":{"name":"JOURNAL OF INTERCONNECTION NETWORKS","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2023-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90853715","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-07-19DOI: 10.1142/s0219265923500093
Xue Feng, Shenglin Geng, Banghe Han
An efficient solution to the misleading solutions of decision-making problems is the study of consistency when the decision makers express their opinions by means of fuzzy preference relations. To elucidate the consistency of HFPRs, the S-ordinal consistency of HFPRs was proposed, and S-OCI was also proposed to evaluate the degree of consistency of a hesitant fuzzy preference relation by calculating the unreasonable 3-cycles in the directed graph. Two novel methods were also proposed for calculation of the S-OCI. Moreover, the inconsistent judgment in hesitation fuzzy preference relation was developed. In order to repair the inconsistency of a hesitant fuzzy preference relation, an algorithm for finding and removing 3-cycles in digraph was developed. Finally, some illustrative examples were given to prove the effectiveness of the method.
{"title":"The Ordinal Consistency of a Hesitant Fuzzy Preference Relation","authors":"Xue Feng, Shenglin Geng, Banghe Han","doi":"10.1142/s0219265923500093","DOIUrl":"https://doi.org/10.1142/s0219265923500093","url":null,"abstract":"An efficient solution to the misleading solutions of decision-making problems is the study of consistency when the decision makers express their opinions by means of fuzzy preference relations. To elucidate the consistency of HFPRs, the S-ordinal consistency of HFPRs was proposed, and S-OCI was also proposed to evaluate the degree of consistency of a hesitant fuzzy preference relation by calculating the unreasonable 3-cycles in the directed graph. Two novel methods were also proposed for calculation of the S-OCI. Moreover, the inconsistent judgment in hesitation fuzzy preference relation was developed. In order to repair the inconsistency of a hesitant fuzzy preference relation, an algorithm for finding and removing 3-cycles in digraph was developed. Finally, some illustrative examples were given to prove the effectiveness of the method.","PeriodicalId":53990,"journal":{"name":"JOURNAL OF INTERCONNECTION NETWORKS","volume":"12 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2023-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75870466","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-07-19DOI: 10.1142/s0219265923500123
Guoqiang Xie, J. Meng
A strong digraph [Formula: see text] is strongly Menger (arc) connected if, for [Formula: see text], [Formula: see text] can reach [Formula: see text] by min[Formula: see text] internally (arc) disjoint-directed paths. A digraph [Formula: see text] is [Formula: see text](-arc)-fault-tolerant strongly Menger([Formula: see text]-(A)FTSM, for short) (arc) connected if [Formula: see text] is strongly Menger (arc) connected for every [Formula: see text](respectively, [Formula: see text]) with [Formula: see text]. A digraph [Formula: see text] is [Formula: see text]-conditional (arc)-fault-tolerant strongly Menger ([Formula: see text]-C(A)FTSM, for short) (arc) connected if [Formula: see text] is strongly Menger (arc) connected for every [Formula: see text](respectively, [Formula: see text]) with [Formula: see text] and [Formula: see text]. The directed [Formula: see text]-ary [Formula: see text]-cube [Formula: see text] [Formula: see text] and [Formula: see text] is a digraph with vertex set [Formula: see text]. For two vertices [Formula: see text] and [Formula: see text], [Formula: see text] dominates [Formula: see text] if there exists an integer [Formula: see text], [Formula: see text], satisfying [Formula: see text]mod [Formula: see text] and [Formula: see text], when [Formula: see text]. In this paper, we show that [Formula: see text] [Formula: see text] is [Formula: see text]-AFTSM arc connected when [Formula: see text], [Formula: see text]-FTSM connected when [Formula: see text], [Formula: see text]-CAFTSM arc connected when [Formula: see text], and [Formula: see text]-CFTSM connected when [Formula: see text].
{"title":"The Strong Menger Connectivity of the Directed k-Ary n-Cube","authors":"Guoqiang Xie, J. Meng","doi":"10.1142/s0219265923500123","DOIUrl":"https://doi.org/10.1142/s0219265923500123","url":null,"abstract":"A strong digraph [Formula: see text] is strongly Menger (arc) connected if, for [Formula: see text], [Formula: see text] can reach [Formula: see text] by min[Formula: see text] internally (arc) disjoint-directed paths. A digraph [Formula: see text] is [Formula: see text](-arc)-fault-tolerant strongly Menger([Formula: see text]-(A)FTSM, for short) (arc) connected if [Formula: see text] is strongly Menger (arc) connected for every [Formula: see text](respectively, [Formula: see text]) with [Formula: see text]. A digraph [Formula: see text] is [Formula: see text]-conditional (arc)-fault-tolerant strongly Menger ([Formula: see text]-C(A)FTSM, for short) (arc) connected if [Formula: see text] is strongly Menger (arc) connected for every [Formula: see text](respectively, [Formula: see text]) with [Formula: see text] and [Formula: see text]. The directed [Formula: see text]-ary [Formula: see text]-cube [Formula: see text] [Formula: see text] and [Formula: see text] is a digraph with vertex set [Formula: see text]. For two vertices [Formula: see text] and [Formula: see text], [Formula: see text] dominates [Formula: see text] if there exists an integer [Formula: see text], [Formula: see text], satisfying [Formula: see text]mod [Formula: see text] and [Formula: see text], when [Formula: see text]. In this paper, we show that [Formula: see text] [Formula: see text] is [Formula: see text]-AFTSM arc connected when [Formula: see text], [Formula: see text]-FTSM connected when [Formula: see text], [Formula: see text]-CAFTSM arc connected when [Formula: see text], and [Formula: see text]-CFTSM connected when [Formula: see text].","PeriodicalId":53990,"journal":{"name":"JOURNAL OF INTERCONNECTION NETWORKS","volume":"11 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2023-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90673121","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-07-17DOI: 10.1142/s0219265923500111
Ying-zi Ma, Hui Zhang
Given a set [Formula: see text] with [Formula: see text], a tree [Formula: see text] is considered as a total proper [Formula: see text]-tree or a total proper tree connecting [Formula: see text] if any two adjacent or incident elements of edges and [Formula: see text] of [Formula: see text] differ in color. Let [Formula: see text] be a connected graph of order [Formula: see text], and [Formula: see text] be an integer with [Formula: see text]. A total-colored graph is total proper[Formula: see text]-tree connected if for every set [Formula: see text] of [Formula: see text] vertices, there exists a total proper [Formula: see text]-tree in [Formula: see text]. The [Formula: see text]-total-proper index of [Formula: see text], denoted by [Formula: see text], is the minimum number of colors required to make [Formula: see text] total proper [Formula: see text]-tree connected. In this paper, we first investigate the [Formula: see text]-total-proper index of some special graphs. Moreover, we characterize the graphs with [Formula: see text]-total-proper index [Formula: see text] and [Formula: see text], respectively.
{"title":"The k-Total-Proper Index of Graphs","authors":"Ying-zi Ma, Hui Zhang","doi":"10.1142/s0219265923500111","DOIUrl":"https://doi.org/10.1142/s0219265923500111","url":null,"abstract":"Given a set [Formula: see text] with [Formula: see text], a tree [Formula: see text] is considered as a total proper [Formula: see text]-tree or a total proper tree connecting [Formula: see text] if any two adjacent or incident elements of edges and [Formula: see text] of [Formula: see text] differ in color. Let [Formula: see text] be a connected graph of order [Formula: see text], and [Formula: see text] be an integer with [Formula: see text]. A total-colored graph is total proper[Formula: see text]-tree connected if for every set [Formula: see text] of [Formula: see text] vertices, there exists a total proper [Formula: see text]-tree in [Formula: see text]. The [Formula: see text]-total-proper index of [Formula: see text], denoted by [Formula: see text], is the minimum number of colors required to make [Formula: see text] total proper [Formula: see text]-tree connected. In this paper, we first investigate the [Formula: see text]-total-proper index of some special graphs. Moreover, we characterize the graphs with [Formula: see text]-total-proper index [Formula: see text] and [Formula: see text], respectively.","PeriodicalId":53990,"journal":{"name":"JOURNAL OF INTERCONNECTION NETWORKS","volume":"83 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2023-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74470764","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-06-21DOI: 10.1142/s021926592350010x
Xiao Xu, Zhuoma Gao, Lei Meng, Qin Tong
Let [Formula: see text] be an integer. The [Formula: see text]-factor of a graph [Formula: see text] is a spanning subgraph [Formula: see text] if [Formula: see text] for all [Formula: see text], and the [Formula: see text]-factor is a subgraph whose each component is either [Formula: see text] or [Formula: see text]. In this paper, we give the lower bounds with regard to tight toughness, isolated toughness and binding number to guarantee the existence of the [Formula: see text]-factors and [Formula: see text]-factors for a graph.
{"title":"Tight Toughness, Isolated Toughness and Binding Number Bounds for the [1,n]-Factors and the {K2,Ci≥4}-Factors","authors":"Xiao Xu, Zhuoma Gao, Lei Meng, Qin Tong","doi":"10.1142/s021926592350010x","DOIUrl":"https://doi.org/10.1142/s021926592350010x","url":null,"abstract":"Let [Formula: see text] be an integer. The [Formula: see text]-factor of a graph [Formula: see text] is a spanning subgraph [Formula: see text] if [Formula: see text] for all [Formula: see text], and the [Formula: see text]-factor is a subgraph whose each component is either [Formula: see text] or [Formula: see text]. In this paper, we give the lower bounds with regard to tight toughness, isolated toughness and binding number to guarantee the existence of the [Formula: see text]-factors and [Formula: see text]-factors for a graph.","PeriodicalId":53990,"journal":{"name":"JOURNAL OF INTERCONNECTION NETWORKS","volume":"27 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2023-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80472320","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-06-21DOI: 10.1142/s0219265923500081
Sheena Mohammed, Sridevi Rangu
Privacy and security are the most concerning topics while using cloud-based applications. Malware detection in cloud applications is important in identifying application malware activity. So, a novel Goat-based Recurrent Forensic Mechanism (GbRFM) is used to detect the attack and provide the attack type in cloud-based applications. At first, the dataset is pre-processed in the hidden phase, and the errorless features are extracted. The proposed model also trains the output of the hidden layer to identify and classify the malware. The wild goat algorithm enhances the identification rate by accurately detecting the attack. Using the NSL-KDD data, the preset research was verified, and the outcomes were evaluated. The performance assessment indicates that the developed model gained a 99.26% accuracy rate for the NSL-KDD dataset. Moreover, to validate the efficiency of the proposed model, the outcomes are compared with other techniques. The comparison analysis proved that the proposed model attained better results.
{"title":"To Secure the Cloud Application Using a Novel Efficient Deep Learning-Based Forensic Framework","authors":"Sheena Mohammed, Sridevi Rangu","doi":"10.1142/s0219265923500081","DOIUrl":"https://doi.org/10.1142/s0219265923500081","url":null,"abstract":"Privacy and security are the most concerning topics while using cloud-based applications. Malware detection in cloud applications is important in identifying application malware activity. So, a novel Goat-based Recurrent Forensic Mechanism (GbRFM) is used to detect the attack and provide the attack type in cloud-based applications. At first, the dataset is pre-processed in the hidden phase, and the errorless features are extracted. The proposed model also trains the output of the hidden layer to identify and classify the malware. The wild goat algorithm enhances the identification rate by accurately detecting the attack. Using the NSL-KDD data, the preset research was verified, and the outcomes were evaluated. The performance assessment indicates that the developed model gained a 99.26% accuracy rate for the NSL-KDD dataset. Moreover, to validate the efficiency of the proposed model, the outcomes are compared with other techniques. The comparison analysis proved that the proposed model attained better results.","PeriodicalId":53990,"journal":{"name":"JOURNAL OF INTERCONNECTION NETWORKS","volume":"27 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2023-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89833021","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-06-10DOI: 10.1142/s021926592350007x
Zhao Wang, Hongfang Liu, Yuhu Liu
The concept of [Formula: see text]-independent set, introduced by Fink and Jacobson in 1986, is a natural generalization of classical independence set. A k-independent set is a set of vertices whose induced subgraph has maximum degree at most [Formula: see text]. The k-independence number of [Formula: see text], denoted by [Formula: see text], is defined as the maximum cardinality of a [Formula: see text]-independent set of [Formula: see text]. As a natural counterpart of the [Formula: see text]-independence number, we introduced the concept of [Formula: see text]-edge-independence number. An edge set [Formula: see text] in [Formula: see text] is called k-edge-independent if the maximum degree of the subgraph induced by the edges in [Formula: see text] is less or equal to [Formula: see text]. The k-edge-independence number, denoted [Formula: see text], is defined as the maximum cardinality of a [Formula: see text]-edge-independent set. In this paper, we study the Nordhaus–Gaddum-type results for the parameter [Formula: see text] and [Formula: see text]. We obtain sharp upper and lower bounds of [Formula: see text], [Formula: see text], [Formula: see text] and [Formula: see text] for a graph [Formula: see text] of order [Formula: see text]. Some graph classes attaining these bounds are also given.
{"title":"Nordhaus–Gaddum-Type Results for the k-Independent Number of Graphs","authors":"Zhao Wang, Hongfang Liu, Yuhu Liu","doi":"10.1142/s021926592350007x","DOIUrl":"https://doi.org/10.1142/s021926592350007x","url":null,"abstract":"The concept of [Formula: see text]-independent set, introduced by Fink and Jacobson in 1986, is a natural generalization of classical independence set. A k-independent set is a set of vertices whose induced subgraph has maximum degree at most [Formula: see text]. The k-independence number of [Formula: see text], denoted by [Formula: see text], is defined as the maximum cardinality of a [Formula: see text]-independent set of [Formula: see text]. As a natural counterpart of the [Formula: see text]-independence number, we introduced the concept of [Formula: see text]-edge-independence number. An edge set [Formula: see text] in [Formula: see text] is called k-edge-independent if the maximum degree of the subgraph induced by the edges in [Formula: see text] is less or equal to [Formula: see text]. The k-edge-independence number, denoted [Formula: see text], is defined as the maximum cardinality of a [Formula: see text]-edge-independent set. In this paper, we study the Nordhaus–Gaddum-type results for the parameter [Formula: see text] and [Formula: see text]. We obtain sharp upper and lower bounds of [Formula: see text], [Formula: see text], [Formula: see text] and [Formula: see text] for a graph [Formula: see text] of order [Formula: see text]. Some graph classes attaining these bounds are also given.","PeriodicalId":53990,"journal":{"name":"JOURNAL OF INTERCONNECTION NETWORKS","volume":"36 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2023-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90752123","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-05-31DOI: 10.1142/s0219265923500068
Zhiwei Guo
For a graph [Formula: see text] and positive integers [Formula: see text], [Formula: see text], a [Formula: see text]-tree-vertex coloring of [Formula: see text] refers to a [Formula: see text]-vertex coloring of [Formula: see text] satisfying every component of each induced subgraph generated by every set of vertices with the same color forms a tree with maximum degree not larger than [Formula: see text], and it is called equitable if the difference between the cardinalities of every pair of sets of vertices with the same color is at most [Formula: see text]. The strong equitable vertex [Formula: see text]-arboricity of [Formula: see text], denoted by [Formula: see text], is defined as the least positive integer [Formula: see text] satisfying [Formula: see text], which admits an equitable [Formula: see text]-tree-vertex coloring for each integer [Formula: see text] with [Formula: see text]. The strong equitable vertex [Formula: see text]-arboricity of a graph is very useful in graph theory applications such as load balance in parallel memory systems, constructing timetables and scheduling. In this paper, we present the tight upper and lower bounds on [Formula: see text] for an arbitrary graph [Formula: see text] with [Formula: see text] vertices and a given integer [Formula: see text] with [Formula: see text], and we characterize the extremal graphs [Formula: see text] with [Formula: see text], [Formula: see text], [Formula: see text], respectively. Based on the above extremal results, we further obtain the Nordhaus–Gaddum-type results for [Formula: see text] of graphs [Formula: see text] with [Formula: see text] vertices for a given integer [Formula: see text] with [Formula: see text].
{"title":"Nordhaus–Gaddum-Type Results for the Strong Equitable Vertex k-Arboricity of Graphs","authors":"Zhiwei Guo","doi":"10.1142/s0219265923500068","DOIUrl":"https://doi.org/10.1142/s0219265923500068","url":null,"abstract":"For a graph [Formula: see text] and positive integers [Formula: see text], [Formula: see text], a [Formula: see text]-tree-vertex coloring of [Formula: see text] refers to a [Formula: see text]-vertex coloring of [Formula: see text] satisfying every component of each induced subgraph generated by every set of vertices with the same color forms a tree with maximum degree not larger than [Formula: see text], and it is called equitable if the difference between the cardinalities of every pair of sets of vertices with the same color is at most [Formula: see text]. The strong equitable vertex [Formula: see text]-arboricity of [Formula: see text], denoted by [Formula: see text], is defined as the least positive integer [Formula: see text] satisfying [Formula: see text], which admits an equitable [Formula: see text]-tree-vertex coloring for each integer [Formula: see text] with [Formula: see text]. The strong equitable vertex [Formula: see text]-arboricity of a graph is very useful in graph theory applications such as load balance in parallel memory systems, constructing timetables and scheduling. In this paper, we present the tight upper and lower bounds on [Formula: see text] for an arbitrary graph [Formula: see text] with [Formula: see text] vertices and a given integer [Formula: see text] with [Formula: see text], and we characterize the extremal graphs [Formula: see text] with [Formula: see text], [Formula: see text], [Formula: see text], respectively. Based on the above extremal results, we further obtain the Nordhaus–Gaddum-type results for [Formula: see text] of graphs [Formula: see text] with [Formula: see text] vertices for a given integer [Formula: see text] with [Formula: see text].","PeriodicalId":53990,"journal":{"name":"JOURNAL OF INTERCONNECTION NETWORKS","volume":"31 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2023-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74424181","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-05-29DOI: 10.1142/s0219265923990013
{"title":"Author Index Volume 23 (2023)","authors":"","doi":"10.1142/s0219265923990013","DOIUrl":"https://doi.org/10.1142/s0219265923990013","url":null,"abstract":"","PeriodicalId":53990,"journal":{"name":"JOURNAL OF INTERCONNECTION NETWORKS","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2023-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78759893","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-01-05DOI: 10.1142/s0219265922420038
Zhexiong Cui, J. Ren
Big data analysis of human behavior can provide the basis and support for the application of various scenarios. Using sensors for human behavior analysis is an effective means of identification method, which is very valuable for research. To address the problems of low recognition accuracy, low recognition efficiency of traditional human behavior recognition (HBR) algorithms in complex scenes, in this paper, we propose an HBR algorithm for Mobile Big data analytics in wireless sensor network using improved transfer learning. First, different wireless sensors are fused to obtain human behavior mobile big data, and then by analyzing the importance of human behavior features (HBF), the dynamic change parameters of HBF extraction threshold are calculated. Second, combined with the dynamic change parameters of threshold, the HBF of complex scenes are extracted. Finally, the best classification function of human behavior in complex scenes is obtained by using the classification function of HBF in complex scenes. Human behavior in complex scenes is classified according to the HBF in the feature set. The HBR algorithm is designed by using the improved transfer learning network to realize the recognition of human behavior in complex scenes. The results show that the proposed algorithm can accurately recognize up to 22 HBF points, and can control the HBR time within 2 s. The human behavior false recognition rate of miscellaneous scenes is less than 10%. The recognition speed is above 10/s, and the recall rate can reach more than 98%, which improves the HBR ability of complex scenes.
{"title":"Mobile Big Data Analytics for Human Behavior Recognition in Wireless Sensor Network Based on Transfer Learning","authors":"Zhexiong Cui, J. Ren","doi":"10.1142/s0219265922420038","DOIUrl":"https://doi.org/10.1142/s0219265922420038","url":null,"abstract":"Big data analysis of human behavior can provide the basis and support for the application of various scenarios. Using sensors for human behavior analysis is an effective means of identification method, which is very valuable for research. To address the problems of low recognition accuracy, low recognition efficiency of traditional human behavior recognition (HBR) algorithms in complex scenes, in this paper, we propose an HBR algorithm for Mobile Big data analytics in wireless sensor network using improved transfer learning. First, different wireless sensors are fused to obtain human behavior mobile big data, and then by analyzing the importance of human behavior features (HBF), the dynamic change parameters of HBF extraction threshold are calculated. Second, combined with the dynamic change parameters of threshold, the HBF of complex scenes are extracted. Finally, the best classification function of human behavior in complex scenes is obtained by using the classification function of HBF in complex scenes. Human behavior in complex scenes is classified according to the HBF in the feature set. The HBR algorithm is designed by using the improved transfer learning network to realize the recognition of human behavior in complex scenes. The results show that the proposed algorithm can accurately recognize up to 22 HBF points, and can control the HBR time within 2 s. The human behavior false recognition rate of miscellaneous scenes is less than 10%. The recognition speed is above 10/s, and the recall rate can reach more than 98%, which improves the HBR ability of complex scenes.","PeriodicalId":53990,"journal":{"name":"JOURNAL OF INTERCONNECTION NETWORKS","volume":"84 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2023-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73336443","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：