检索结果-内蒙古大学图书馆

Identifying Scientific and Technical“Unicorns”

Journal of data and Information Science 2021年第2期6卷 96-115页

作者： Lucy L.Xu Miao Qi Fred Y.Ye Jiangsu Key Laboratory of Data Engineering and Knowledge Service School of Information ManagementNanjing UniversityNanjing 210023China University Library Nantong UniversityNantong 226019China

Purpose:Using the metaphor of"unicorn,"we identify the scientific papers and technical patents characterized by the informetric feature of very high citations in the first ten years after publishing,which may provide a new pattern to understand very high impact works in science and ***/methodology/approach:When we set CT as the total citations of papers or patents in the first ten years after publication,with CT≥5,000 for scientific"unicorn"and CT≥500 for technical"unicorn,"we have an absolute standard for identifying scientific and technical"unicorn"***:We identify 165 scientific"unicorns"in 14,301,875 WoS papers and 224 technical"unicorns"in 13,728,950 DII patents during 2001–*** 50%of"unicorns"belong to biomedicine,in which selected cases are individually *** rare"unicorns"increase following linear model,the fitting data show 95%confidence with the RMSE of scientific"unicorn"is 0.2127 while the RMSE of technical"unicorn"is *** limitations:A"unicorn"is a pure quantitative consideration without concerning its quality,and"potential unicorns"as CT≤5,000 for papers and CT≤500 for patents are left in future *** implications:Scientific and technical"unicorns"provide a new pattern to understand high-impact works in science and ***"unicorn"pattern supplies a concise approach to identify very high-impact scientific papers and technical ***/value:The"unicorn"pattern supplies a concise approach to identify very high impact scientific papers and technical patents.

关键词： Unicorn Scientific paper Technical patent Citation analysis Patent analysis

来源：评论

学校读者我要写书评

暂无评论

On charactering of information propagation in online social networks

引用

Journal of Networks 2013年第1期8卷 124-131页

作者： Han, Xiaoting Niu, Li School of Economics and Management Beihang University Beijing China Key Laboratory of Ministry of Education for Data Engineering and Knowledge Engineering Renmin University of China Beijing China School of Information Resource Management Renmin University of China Beijing China

Recent years have witnessed the explosive growth of online social networks (OSNs), which provide a perfect platform for observing the information propagation. Based on the theory of complex network analysis, considering each node in OSNs as an agent, an information propagation model called IP-OSN has been proposed in this paper, and numerical simulation experiments have been extensively conducted, which show the mechanism of information propagation in OSNs. It can be seen from the experimental results that along with the information spreading scope will be larger while time passing. Moreover, from the network structure perspective, some interesting findings are got. First, the number of initial known nodes has a certain impact on the information propagation speed;however it doesn't affect the number of final known and unknown nodes. Then, the number of neighbors has a great impact on the information propagation process and results. Finally, percentage of different user type is the decisive factor for information propagation either in final node number or propagation speed. This paper attempts to complement the theoretical framework of information propagation and complex networks, and thus to further promote the practice of information control in OSNs. © 2013 ACADEMY PUBLISHER.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

Unsupervised Statistical Text Simplification

引用

IEEE Transactions on knowledge and data engineering 2021年第4期33卷 1802-1806页

作者： Qiang, Jipeng Wu, Xindong Department of Computer Science Yangzhou University Yangzhou Jiangsu225127 China Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education Hefei Anhui10084 China

Most recent approaches for Text Simplification (TS) have drawn on insights from machine translation to learn simplification rewrites from the monolingual parallel corpus of complex and simple sentences, yet their effectiveness strongly relies on large amounts of parallel sentences. However, there has been a serious problem haunting TS for decades, that is, the availability of parallel TS corpora is scarce or not fit for the learning task. In this paper, we will focus on one especially useful and challenging problem of unsupervised TS without a single parallel sentence. To the best of our knowledge, we present the first unsupervised text simplification system based on phrase-based machine translation system, which leverages a careful initialization of phrase tables and language models. On the widely used WikiLarge and WikiSmall benchmarks, our system respectively obtains 39.08 and 25.12 SARI points, even outperforms some supervised baselines. © 1989-2012 IEEE.

关键词： Machine translation

来源：评论

学校读者我要写书评

暂无评论

Quality aware privacy protection for location-based services

引用

12th International Conference on database Systems for Advanced Applications, DASFAA 2007

作者： Zhen, Xiao Xiaofeng, Meng Jianliang, Xu School of Information Renmin University of China Key Laboratory of Data Engineering and Knowledge Engineering MOE Department of Computer Science Hong Kong Baptist University

ISBN: (纸本)9783540717027

Protection of users' privacy has been a central issue for location-based services (LBSs). In this paper, we classify two kinds of privacy protection requirements in LBS: location anonymity and identifier anonymity. While the location cloaking technique under the k-anonymity model can provide a good protection of users' privacy, it reduces the resolution of location information and, hence, may degrade the quality of service (QoS). To strike a balance between the location privacy and QoS, we present a quality-aware anonymity model for protecting location privacy while meeting user specified QoS requirements. In the model, a mobile user can specify the minimum anonymity level requirement upon location privacy as well as the maximum cloaking latency and the maximum cloaking region size requirements upon QoS. In accordance with the model, we develop an efficient directed-graph based cloaking algorithm to achieve both high-quality location anonymity and identifier anonymity. The performance objective is to maximize the cloaking success rate under the privacy and QoS constraints. Furthermore, we introduce an option of using dummy locations to achieve a 100% cloaking success rate at the cost of communication overhead. Experimental results show the effectiveness of our cloaking algorithm under various privacy and QoS requirements. © Springer-Verlag Berlin Heidelberg 2007.

关键词： Tracking (position)

来源：评论

学校读者我要写书评

暂无评论

High Dynamic Collaborative Team Query via Multi-Fuzzy-Constrained Graph Pattern Matching 9

High Dynamic Collaborative Team Query via Multi-Fuzzy-Constr...

引用

9th International Conference on Cloud Computing and Big data Analytics, ICCCBDA 2024

作者： Hu, Tao Zhang, Zan Bu, Chenyang Li, Lei Key Laboratory of Knowledge Engineering with Big Data The Ministry of Education of China School of Computer Science and Information Engineering Hefei University of Technology Hefei China

ISBN: (纸本)9798350373554

Graph pattern matching is a technique widely used in various fields such as protein structure analysis, social group querying, and expert localization. This technique involves finding matching subgraphs in large social networks that align with the patterns specified in the pattern graph. In this paper, we focus on a specific sub-problem in social group querying, known as the cooperative team query, which arises from practical applications, where the nodes in the pattern graph and the data graph represent team member entities, while the edges represent their social relationships. We note that the requirements of many teams in the real world are dynamic, necessitating iterative computation for graph pattern matching using traditional methods. To address this challenge in highly dynamic systems, we propose a graph pattern matching method based on core pattern graph matching cache. This approach involves extracting the core pattern graph, and comprising core team members based on the characteristics of cooperative teams. The core graph-based matching cache enables the second half of the algorithm to operate on an order-of-magnitude smaller graph, significantly improving efficiency. Additionally, the multi-threaded approach fully leverages hardware resources, synchronizing multiple matching result of the core pattern graph to reduce matching time. Experimental results on three real social network datasets demonstrate that our proposed algorithm, Core Pattern Graph Matching Cache-based Multi-threaded Exploration (CCMTE), significantly outperforms existing methods in terms of efficiency. © 2024 IEEE.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

Joint user profiling with hierarchical attention networks

引用

Frontiers of Computer Science 2023年第3期17卷 133-143页

作者： Xiaojian LIU Yi ZHU Xindong WU Key Laboratory of Knowledge Engineering with Big Data(Hefei University of Technology) Ministry of EducationHefei 230009China School of Computer Science and Information Engineering Hefei University of TechnologyHefei 230009China School of Information Engineering Yangzhou UniversityYangzhou 225009China Mininglamp Academy of Sciences MininglampBeijing 100193China

User profiling by inferring user personality traits,such as age and gender,plays an increasingly important role in many real-world *** existing methods for user profiling either use only one type of data or ignore handling the noisy information of ***,they usually consider this problem from only one *** this paper,we propose a joint user profiling model with hierarchical attention networks(JUHA)to learn informative user representations for user *** JUHA method does user profiling based on both inner-user and inter-user *** explore inner-user features from user behaviors(e.g.,purchased items and posted blogs),and inter-user features from a user-user graph(where similar users could be connected to each other).JUHA learns basic sentence and bag representations from multiple separate sources of data(user behaviors)as the first round of data *** this module,convolutional neural networks(CNNs)are introduced to capture word and sentence features of age and gender while the self-attention mechanism is exploited to weaken the noisy *** this,we build another bag which contains a user-user ***-user features are learned from this bag using propagation information between linked users in the *** acquire more robust data,inter-user features and other inner-user bag representations are joined into each sentence in the current bag to learn the final bag ***,all of the bag representations are integrated to lean comprehensive user representation by the self-attention *** experimental results demonstrate that our approach outperforms several state-of-the-art methods and improves prediction performance.

关键词： user profiling hierarchical attention joint learning inner-user feature inter-user feature

来源：评论

学校读者我要写书评

暂无评论

RGB-D SLAM Method Based on Feature Association in Dynamic Environment 6

RGB-D SLAM Method Based on Feature Association in Dynamic En...

引用

6th Asian Conference on Artificial Intelligence Technology, ACAIT 2022

作者： Fang, Baofu Wang, Hao Wang, Hao Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology School of Computer Science and Information Engineering Hefei China

ISBN: (纸本)9781665453110

Simultaneous localization and mapping (SLAM) is one of the current research hotspots. However, in visual SLAM for dynamic environments, inaccurate detection of object motion states and incomplete dynamic region culling will lead to large localization errors. To address these issues, this paper proposes an RGB-D SLAM method based on feature association. The method has strongly correlated features in time and space according to the input image sequence. Using the moving probability of the feature points in the previous frame, the movement of the feature points in the current frame is calculated in combination with the dynamic corner points screened in the current frame. Then, the motion state of the object is determined according to the proportion of different feature points. Then combined with semantic information and object depth information, the fast search method is used to obtain accurate dynamic regions. Finally, the selected effective feature points are used to estimate the camera pose and establish a static map of the environment. This paper evaluates the robustness and accuracy of our method on the TUM dataset and real environment, and the results show that our method can significantly improve the system tracking effect and reduce the system tracking error compared with other SLAM methods in dynamic environments. © 2022 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Semantic SLAM Based on Compensated Segmentation and Geometric Constraints in Dynamic Environments 6

Semantic SLAM Based on Compensated Segmentation and Geometri...

引用

6th Asian Conference on Artificial Intelligence Technology, ACAIT 2022

作者： Fang, Baofu Zhou, Shuai Wang, Hao Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology School of Computer Science and Information Engineering Hefei China

ISBN: (纸本)9781665453110

Most of the existing slam algorithms are designed based on the assumption of a static environment, this strong assumption limits the practical application of most slam systems. The main reason is that moving objects will cause feature mismatch in the pose estimation process, which in turn affects the accuracy of localization and mapping. In this paper, we propose a SLAM algorithm in a dynamic environment. First, we use the BlendMask network to detect potential moving objects to generate masks for dynamic objects. The geometrically constrained joint optical flow method is used to detect dynamic feature points. Secondly, aiming at the failure of semantic segmentation network segmentation, a missed detection compensation algorithm based on the invariance of adjacent frame speed is proposed. Finally, a keyframe selection strategy is proposed to construct a semantic octree graph containing only static objects. We evaluate our algorithm on TUM RGB-D and real scene datasets. The experimental results show that the algorithm has high accuracy and real-time performance. © 2022 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Ensemble Learning Based Employment Recommendation Under Interaction Sparsity for College Students 9th

Ensemble Learning Based Employment Recommendation Under Inte...

引用

19th International Conference on Advanced data Mining and Applications, ADMA 2023

作者： Zhu, Haiping Zhao, Yifei Wu, Yuchen Chen, Yan Li, Wenhao Zheng, Qinghua Tian, Feng Department of Computer Science and Technology Xi’an Jiaotong University Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi’an China

ISBN: (纸本)9783031466632

Recommendation systems play a crucial role in helping college students find job opportunities. However, the sparsity of interactions in employment recommendation for college students poses a challenge for models based on historical user preferences. To address this issue, we propose a novel model called Ensemble Learning based Employment Recommendation under Interaction Sparsity for College Students (EERIS). The model comprises two components: a similarity information component that uses pooled users to determine the nearest neighbor in user similarity measurement, and a global interaction component that uses interaction vectors of user groups to enhance interactions. To evaluate the missing interactions, we propose a loss function called CellLoss. These components are combined based on ensemble learning to improve the model’s generalization and scalability. Our experiments on two real-world datasets demonstrate the superior performance of the EERIS model. Ablation experiments further confirm that each component positively contributes to the model’s performance. Additionally, we design a revised metric for better model testing. Overall, the proposed EERIS model effectively addresses the interaction sparsity in employment recommendation for college students and provides satisfactory recommendations to students. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

A hybrid model for explaining older adults' continuance intention toward SNSs 8

A hybrid model for explaining older adults' continuance inte...

引用

8th International Conference on Management of e-Commerce and e-Government, ICMeCG 2014

作者： Liu, Wei Jiangxi Key Laboratory of Data and Knowledge Engineering Institute of Information Resources Management Jiangxi University of Finance and Economics Nanchang360013 China

ISBN: (纸本)9781479965434

Due to the rapid growth of social net services (SNSs), research into SNSs continuance usage has recently emerged as an important issue in information systems adaption. This study develops an integrated model based on the expectation-confirmation model (ECM), the technology acceptance model (TAM), and the theory of planned behavior (TPB), and apply them into the context of older adults' continuance intention toward SNSs. The hypothesized model is validated empirically using a sample collected from 250 older adults who had prior experience with SNSs and was tested against the proposed research model using structure equation modeling. Analysis results demonstrate that satisfaction has the most significant effect on older adults' continuance intention, followed by perceived usefulness, attitude, subject norm and perceived behavioral control. The results of these findings for SNSs practitioners are discussed at the end of this work. © 2014 IEEE.

关键词： Adoption model continuance intention Older adults SNSs

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：