As a promising technology to improve spectrum efficiency and transmission coverage,Heterogeneous Network(HetNet)has attracted the attention of many scholars in recent years.Additionally,with the introduction of the No...As a promising technology to improve spectrum efficiency and transmission coverage,Heterogeneous Network(HetNet)has attracted the attention of many scholars in recent years.Additionally,with the introduction of the Non-Orthogonal Multiple Access(NOMA)technology,the NOMA-assisted HetNet cannot only improve the system capacity but also allow more users to utilize the same frequency band resource,which makes the NOMA-assisted HetNet a hot topic.However,traditional resource allocation schemes assume that base stations can exactly estimate direct link gains and cross-tier link gains,which is impractical for practical HetNets due to the impact of channel delays and random perturbation.To further improve energy utilization and system robustness,in this paper,we investigate a robust resource allocation problem to maximize the total Energy Efficiency(EE)of Small-Cell Users(SCUs)in NOMA-assisted HetNets under imperfect channel state information.By considering bounded channel uncertainties,the robust resource optimization problem is formulated as a mixed-integer and nonlinear programming problem under the constraints of the cross-tier interference power of macrocell users,the maximum transmit power of small base station,the Resource Block(RB)assignment,and the quality of service requirement of each SCU.The original problem is converted into an equivalent convex optimization problem by using Dinkelbach's method and the successive convex approximation method.A robust Dinkelbach-based iteration algorithm is designed by jointly optimizing the transmit power and the RB allocation.Simulation results verify that the proposed algorithm has better EE and robustness than the existing algorithms.展开更多
Real-world complex networks are inherently heterogeneous;they have different types of nodes,attributes,and relationships.In recent years,various methods have been proposed to automatically learn how to encode the stru...Real-world complex networks are inherently heterogeneous;they have different types of nodes,attributes,and relationships.In recent years,various methods have been proposed to automatically learn how to encode the structural and semantic information contained in heterogeneous information networks(HINs)into low-dimensional embeddings;this task is called heterogeneous network embedding(HNE).Efficient HNE techniques can benefit various HIN-based machine learning tasks such as node classification,recommender systems,and information retrieval.Here,we provide a comprehensive survey of key advancements in the area of HNE.First,we define an encoder-decoder-based HNE model taxonomy.Then,we systematically overview,compare,and summarize various state-of-the-art HNE models and analyze the advantages and disadvantages of various model categories to identify more potentially competitive HNE frameworks.We also summarize the application fields,benchmark datasets,open source tools,andperformance evaluation in theHNEarea.Finally,wediscuss open issues and suggest promising future directions.We anticipate that this survey will provide deep insights into research in the field of HNE.展开更多
针对现有模型对异质信息网络(heterogeneous information network, HIN)信息提取大部分依赖于元路径,缺乏元路径信息补充以及很少学习异质图中复杂的结构信息等问题,提出一种异质网中基于邻居节点和元路径的推荐算法(NMRec)。提取用户...针对现有模型对异质信息网络(heterogeneous information network, HIN)信息提取大部分依赖于元路径,缺乏元路径信息补充以及很少学习异质图中复杂的结构信息等问题,提出一种异质网中基于邻居节点和元路径的推荐算法(NMRec)。提取用户和物品邻居节点补充元路径缺失的信息,以卷积的方式捕获节点之间丰富的交互,通过注意力机制得到节点和元路径的嵌入表示,拼接用户、物品、邻居节点及元路径进行TOP-N推荐。在两个公开数据集上的实验结果表明,NMRec推荐性能良好,对推荐结果有良好的可解释性,与7种推荐基准算法相比,NMRec在评价指标Pre@10、Recall@10、NDGG@10上至少提升了0.21%、29%、1.46%。展开更多
Heterogeneous information network(HIN)has recently been widely adopted to describe complex graph structure in recommendation systems,proving its effectiveness in modeling complex graph data.Although existing HIN-based...Heterogeneous information network(HIN)has recently been widely adopted to describe complex graph structure in recommendation systems,proving its effectiveness in modeling complex graph data.Although existing HIN-based recommendation studies have achieved great success by performing message propagation between connected nodes on the defined metapaths,they have the following major limitations.Existing works mainly convert heterogeneous graphs into homogeneous graphs via defining metapaths,which are not expressive enough to capture more complicated dependency relationships involved on the metapath.Besides,the heterogeneous information is more likely to be provided by item attributes while social relations between users are not adequately considered.To tackle these limitations,we propose a novel social recommendation model MPISR,which models MetaPath Interaction for Social Recommendation on heterogeneous information network.Specifically,our model first learns the initial node representation through a pretraining module,and then identifies potential social friends and item relations based on their similarity to construct a unified HIN.We then develop the two-way encoder module with similarity encoder and instance encoder to capture the similarity collaborative signals and relational dependency on different metapaths.Extensive experiments on five real datasets demonstrate the effectiveness of our method.展开更多
基金This work was supported by the National Natural Science Foundation of China(No.61601071,62071078)the National Key Research and Development Program of China(No.2019YFC1511300)+2 种基金the Natural Science Foundation of Chongqing(No.cstc2019jcyj-xfkxX0002)the Chongqing Entrepreneurship and Innovation Program for the Returned Overseas Chinese Scholars(No.cx2020095)the Graduate Scientific Research Innovation Project of Chongqing(No.CYS20251,CYS20253).
文摘As a promising technology to improve spectrum efficiency and transmission coverage,Heterogeneous Network(HetNet)has attracted the attention of many scholars in recent years.Additionally,with the introduction of the Non-Orthogonal Multiple Access(NOMA)technology,the NOMA-assisted HetNet cannot only improve the system capacity but also allow more users to utilize the same frequency band resource,which makes the NOMA-assisted HetNet a hot topic.However,traditional resource allocation schemes assume that base stations can exactly estimate direct link gains and cross-tier link gains,which is impractical for practical HetNets due to the impact of channel delays and random perturbation.To further improve energy utilization and system robustness,in this paper,we investigate a robust resource allocation problem to maximize the total Energy Efficiency(EE)of Small-Cell Users(SCUs)in NOMA-assisted HetNets under imperfect channel state information.By considering bounded channel uncertainties,the robust resource optimization problem is formulated as a mixed-integer and nonlinear programming problem under the constraints of the cross-tier interference power of macrocell users,the maximum transmit power of small base station,the Resource Block(RB)assignment,and the quality of service requirement of each SCU.The original problem is converted into an equivalent convex optimization problem by using Dinkelbach's method and the successive convex approximation method.A robust Dinkelbach-based iteration algorithm is designed by jointly optimizing the transmit power and the RB allocation.Simulation results verify that the proposed algorithm has better EE and robustness than the existing algorithms.
基金supported by the National Key Research and Development Plan of China(2017YFB0503700,2016YFB0501801)the National Natural Science Foundation of China(61170026,62173157)+1 种基金the Thirteen Five-Year Research Planning Project of National Language Committee(No.YB135-149)the Fundamental Research Funds for the Central Universities(Nos.CCNU20QN022,CCNU20QN021,CCNU20ZT012).
文摘Real-world complex networks are inherently heterogeneous;they have different types of nodes,attributes,and relationships.In recent years,various methods have been proposed to automatically learn how to encode the structural and semantic information contained in heterogeneous information networks(HINs)into low-dimensional embeddings;this task is called heterogeneous network embedding(HNE).Efficient HNE techniques can benefit various HIN-based machine learning tasks such as node classification,recommender systems,and information retrieval.Here,we provide a comprehensive survey of key advancements in the area of HNE.First,we define an encoder-decoder-based HNE model taxonomy.Then,we systematically overview,compare,and summarize various state-of-the-art HNE models and analyze the advantages and disadvantages of various model categories to identify more potentially competitive HNE frameworks.We also summarize the application fields,benchmark datasets,open source tools,andperformance evaluation in theHNEarea.Finally,wediscuss open issues and suggest promising future directions.We anticipate that this survey will provide deep insights into research in the field of HNE.
文摘针对现有模型对异质信息网络(heterogeneous information network, HIN)信息提取大部分依赖于元路径,缺乏元路径信息补充以及很少学习异质图中复杂的结构信息等问题,提出一种异质网中基于邻居节点和元路径的推荐算法(NMRec)。提取用户和物品邻居节点补充元路径缺失的信息,以卷积的方式捕获节点之间丰富的交互,通过注意力机制得到节点和元路径的嵌入表示,拼接用户、物品、邻居节点及元路径进行TOP-N推荐。在两个公开数据集上的实验结果表明,NMRec推荐性能良好,对推荐结果有良好的可解释性,与7种推荐基准算法相比,NMRec在评价指标Pre@10、Recall@10、NDGG@10上至少提升了0.21%、29%、1.46%。
基金supported by the National Natural Science Foundation of China(Grant Nos.61762078,62276073,61966009 and U22A2099)the Industrial Support Project of Gansu Colleges(No.2022CYZC11)+3 种基金the Natural Science Foundation of Gansu Province(21JR7RA114)the Northwest Normal University Young Teachers Research Capacity Promotion Plan(NWNU-LKQN2019-2)the Industrial Support Project of Gansu Colleges(No.2022CYZC11)the Northwest Normal University Post-graduate Research Funding Project(2021KYZZ02107).
文摘Heterogeneous information network(HIN)has recently been widely adopted to describe complex graph structure in recommendation systems,proving its effectiveness in modeling complex graph data.Although existing HIN-based recommendation studies have achieved great success by performing message propagation between connected nodes on the defined metapaths,they have the following major limitations.Existing works mainly convert heterogeneous graphs into homogeneous graphs via defining metapaths,which are not expressive enough to capture more complicated dependency relationships involved on the metapath.Besides,the heterogeneous information is more likely to be provided by item attributes while social relations between users are not adequately considered.To tackle these limitations,we propose a novel social recommendation model MPISR,which models MetaPath Interaction for Social Recommendation on heterogeneous information network.Specifically,our model first learns the initial node representation through a pretraining module,and then identifies potential social friends and item relations based on their similarity to construct a unified HIN.We then develop the two-way encoder module with similarity encoder and instance encoder to capture the similarity collaborative signals and relational dependency on different metapaths.Extensive experiments on five real datasets demonstrate the effectiveness of our method.
