Each directed graph with the asymmetric costs defined over its arcs,can be represented by a table,which we call an expansion table.The basic properties of cycles and spanning tables of the expansion table correspondin...Each directed graph with the asymmetric costs defined over its arcs,can be represented by a table,which we call an expansion table.The basic properties of cycles and spanning tables of the expansion table corresponding to the cycles and spanning trees of the directed graph is first explored.An algorithm is then derived to find a minimum spanning table corresponding to a minimum spanning tree in the directed graph.Finally,how to use the algorithm to find the optimal expansion of competence set and related problems are discussed.展开更多
Entity set expansion(ESE)aims to expand an entity seed set to obtain more entities which have common properties.ESE is important for many applications such as dictionary con-struction and query suggestion.Traditional ...Entity set expansion(ESE)aims to expand an entity seed set to obtain more entities which have common properties.ESE is important for many applications such as dictionary con-struction and query suggestion.Traditional ESE methods relied heavily on the text and Web information of entities.Recently,some ESE methods employed knowledge graphs(KGs)to extend entities.However,they failed to effectively and fficiently utilize the rich semantics contained in a KG and ignored the text information of entities in Wikipedia.In this paper,we model a KG as a heterogeneous information network(HIN)containing multiple types of objects and relations.Fine-grained multi-type meta paths are proposed to capture the hidden relation among seed entities in a KG and thus to retrieve candidate entities.Then we rank the entities according to the meta path based structural similarity.Furthermore,to utilize the text description of entities in Wikipedia,we propose an extended model CoMeSE++which combines both structural information revealed by a KG and text information in Wikipedia for ESE.Extensive experiments on real-world datasets demonstrate that our model achieves better performance by combining structural and textual information of entities.展开更多
China Minmetals,the country’s largest mineral and metal corporation accelerates its corporate restructuring LAST December was a busy month for China’s leading business entity for all things metal and mineral,China M...China Minmetals,the country’s largest mineral and metal corporation accelerates its corporate restructuring LAST December was a busy month for China’s leading business entity for all things metal and mineral,China Minmetals Corp.(China Minmetals),as it officially established another business arm, China Minmetals Corp.Ltd.(Minmetals Ltd.)-a significant step forward in the company’s restructuring.展开更多
The Lenzing group plans to significantly expand its production capacities and will invest EUR 120 million in both Europe and Asia. The projects will be complete by 2011. Key measures include the expansion of pulp supp...The Lenzing group plans to significantly expand its production capacities and will invest EUR 120 million in both Europe and Asia. The projects will be complete by 2011. Key measures include the expansion of pulp supply and the increase in展开更多
基金Supported by National Natural Science Foundation of China(No.79870 0 30 )
文摘Each directed graph with the asymmetric costs defined over its arcs,can be represented by a table,which we call an expansion table.The basic properties of cycles and spanning tables of the expansion table corresponding to the cycles and spanning trees of the directed graph is first explored.An algorithm is then derived to find a minimum spanning table corresponding to a minimum spanning tree in the directed graph.Finally,how to use the algorithm to find the optimal expansion of competence set and related problems are discussed.
基金This work was supported by the National Natural Science Foundation of China(Grant Nos.61806020,61772082,61972047,61702296)the National Key Research and Development Program of China(2017YFB0803304)+1 种基金the Beijing Municipal Natural Science Foundation(4182043)the CCF-Tencent Open Fund,and the Fundamental Research Funds for the Central Universities.
文摘Entity set expansion(ESE)aims to expand an entity seed set to obtain more entities which have common properties.ESE is important for many applications such as dictionary con-struction and query suggestion.Traditional ESE methods relied heavily on the text and Web information of entities.Recently,some ESE methods employed knowledge graphs(KGs)to extend entities.However,they failed to effectively and fficiently utilize the rich semantics contained in a KG and ignored the text information of entities in Wikipedia.In this paper,we model a KG as a heterogeneous information network(HIN)containing multiple types of objects and relations.Fine-grained multi-type meta paths are proposed to capture the hidden relation among seed entities in a KG and thus to retrieve candidate entities.Then we rank the entities according to the meta path based structural similarity.Furthermore,to utilize the text description of entities in Wikipedia,we propose an extended model CoMeSE++which combines both structural information revealed by a KG and text information in Wikipedia for ESE.Extensive experiments on real-world datasets demonstrate that our model achieves better performance by combining structural and textual information of entities.
文摘China Minmetals,the country’s largest mineral and metal corporation accelerates its corporate restructuring LAST December was a busy month for China’s leading business entity for all things metal and mineral,China Minmetals Corp.(China Minmetals),as it officially established another business arm, China Minmetals Corp.Ltd.(Minmetals Ltd.)-a significant step forward in the company’s restructuring.
文摘The Lenzing group plans to significantly expand its production capacities and will invest EUR 120 million in both Europe and Asia. The projects will be complete by 2011. Key measures include the expansion of pulp supply and the increase in
