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

Hierarchical features-based targeted aspect extraction from online reviews

Intelligent data Analysis 2021年第1期25卷 205-223页

作者： He, Jin Li, Lei Wang, Yan Wu, Xindong Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education Hefei Anhui China School of Computer Science and Information Engineering Hefei University of Technology Hefei Anhui China Department of Computing Macquarie University Sydney Australia MiningLamp Academy of Sciences Mininglamp Techonologies Beijing China

With the prevalence of online review websites, large-scale data promote the necessity of focused analysis. This task aims to capture the information that is highly relevant to a specific aspect. However, the broad scope of the aspects of the various products makes this task overarching but challenging. A commonly used solution is to modify the topic models with additional information to capture the features for a specific aspect (referred to as a targeted aspect). However, the existing topic models, either perform the full analysis to capture features as many as possible or estimate the similarity to capture features as coherent as possible, overlook the fine-grained semantic relations between the features, resulting in the captured features coarse and confusing. In this paper, we propose a novel Hierarchical Features-based Topic Model (HFTM) to extract targeted aspects from online reviews, then to capture the aspect-specific features. Specifically, our model can not only capture the direct features posing target-to-feature semantics but also capture the latent features posing feature-to-feature semantics. The experiments conducted on real-world datasets demonstrate that HFTMl outperforms the state-of-the-art baselines in terms of both aspect extraction and document classification. © 2021 - IOS Press. All rights reserved.

关键词： Aspect extraction Focused analysis Online reviews Text mining Topic modeling

来源：评论

学校读者我要写书评

暂无评论

Understanding the Evolution of the Concept of Artificial Intelligence in Different Publication Venues 16th

Understanding the Evolution of the Concept of Artificial Int...

引用

16th International Conference on Diversity, Divergence, Dialogue, iConference 2021

作者： Xiao, Lianjie Jiang, Weiwei Qin, Kai Ding, Ying Nanjing University Nanjing210023 China Jiangsu Key Laboratory of Data Engineering and Knowledge Service Nanjing210023 China Nanjing University of Finance and Economics Nanjing210023 China The University of Texas at Austin AustinTX78705 United States

ISBN: (纸本)9783030712914

This study aims to clarify the contours of artificial intelligence (AI) and present how it has evolved in different publication venues in the different stages of its development. Based on the noun phrases extracted from scientific papers of AI, the authors constructed the co-occurrence network of noun phrases to visualize the context of AI. There exists a tension between the original descriptive concept of AI as defined initially in the workshop at Dartmouth College and the relatively recent, vague, and extensible concept of AI. AI is used as a technique or boundary object by different scientific publication venues. This paper creatively applies the boundary object theory to clarify the contours of the concept of AI. Besides, the results will bridge the gap between different stakeholders (e.g., AI researchers, government policy makers, and business entities) in different communities together and promote the efficient and effective discussion and communication about AI. © 2021, Springer Nature Switzerland AG.

关键词： Publishing

来源：评论

学校读者我要写书评

暂无评论

Throughput-oriented associated transaction assignment in sharding blockchains for IoT social data storage

引用

Digital Communications and Networks 2022年第6期8卷 885-899页

作者： Liping Tao Yang Lu Xu Ding Yuqi Fan Jung Yoon Kim School of Computer Science and Information Engineering Hefei University of TechnologyHefei230009China Engineering Research Center of Safety Critical Industrial Measurement and Control Technology Ministry of EducationHefei University of TechnologyHefei230009China Institute of Industry&Equipment Technology Hefei University of TechnologyHefei230009China Key Laboratory of Knowledge Engineering with Big Data(Hefei University of Technology) Ministry of EducationHefei230009China Graduate School of Game Gachon UniversitySeongnam-Si461-701South Korea

Blockchain is a viable solution to provide data integrity for the enormous volume of 5G IoT social data, while we need to break through the throughput bottleneck of blockchain. Sharding is a promising technology to solve the problem of low throughput in blockchains. However, cross-shard communication hinders the effective improvement of blockchain throughput. Therefore, it is critical to reasonably allocate transactions to different shards to improve blockchain throughput. Existing research on blockchain sharding mainly focuses on shards formation, configuration, and consensus, while ignoring the negative impact of cross-shard communication on blockchain throughput. Aiming to maximize the throughput of transaction processing, we study how to allocate blockchain transactions to shards in this paper. We propose an Associated Transaction assignment algorithm based on Closest Fit (ATCF). ATCF classifies associated transactions into transaction groups which are then assigned to different shards in the non-ascending order of transaction group sizes periodically. Within each epoch, ATCF tries to select a shard that can handle all the transactions for each transaction group. If there are multiple such shards, ATCF selects the shard with the remaining processing capacity closest to the number of transactions in the transaction group. When no such shard exists, ATCF chooses the shard with the largest remaining processing capacity for the transaction group. The transaction groups that cannot be completely processed within the current epoch will be allocated in the subsequent epochs. We prove that ATCF is a 2-approximation algorithm for the associated transaction assignment problem. Simulation results show that ATCF can effectively improve the blockchain throughput and reduce the number of cross-shard transactions.

关键词： IoT social data Blockchain Shar ding Associated transactions Transaction assi gnment

来源：评论

学校读者我要写书评

暂无评论

P2 Law: Scaling Law for Post-Training After Model Pruning

arXiv

引用

arXiv 2024年

作者： Chen, Xiaodong Hu, Yuxuan Zhang, Xiaokang Wang, Yanling Li, Cuiping Chen, Hong Zhang, Jing School of Information Renmin University of China Beijing China Key Laboratory of Data Engineering and Knowledge Engineering Beijing China Zhongguancun Laboratory China

Pruning has become a widely adopted technique for reducing the hardware requirements of large language models (LLMs). To recover model performance after pruning, post-training is commonly employed to mitigate the resulting performance degradation. While post-training benefits from larger datasets, once the dataset size is already substantial, increasing the training data provides only limited performance gains. To balance post-training cost and model performance, it is necessary to explore the optimal amount of post-training data. Through extensive experiments on the Llama-3 and Qwen-2.5 series models, pruned using various common pruning methods, we uncover the scaling Law for Post-training after model Pruning, referred to as the P2 Law. This law identifies four key factors for predicting the pruned model’s post-training loss: the model size before pruning, the number of post-training tokens, the pruning rate, and the model’s loss before pruning. Moreover, P2 Law can generalize to larger dataset sizes, larger model sizes, and higher pruning rates, offering valuable insights for the post-training of pruned LLMs. © 2024, CC BY.

关键词： Digital elevation model

来源：评论

学校读者我要写书评

暂无评论

An infrastructure with user-centered presentation data model for integrated management of materials data and services

引用

npj Computational Materials 2021年第1期7卷 779-786页

作者： Shilong Liu Yanjing Su Haiqing Yin Dawei Zhang Jie He Haiyou Huang Xue Jiang Xuan Wang Haiyan Gong Zhuang Li Hao Xiu Jiawang Wan Xiaotong Zhang Beijing Advanced Innovation Center for Materials Genome Engineering University of Science and Technology BeijingBeijingChina School of Computer and Communication Engineering University of Science and Technology BeijingBeijingChina Beijing Key Laboratory of Knowledge Engineering for Materials Science BeijingChina Corrosion and Protection Center University of Science and Technology BeijingBeijingChina Collaborative Innovation Center of Steel Technology University of Science and Technology BeijingBeijingChina National Materials Corrosion and Protection Data Center Institute for Advanced Materials and TechnologyUniversity of Science and Technology BeijingBeijingChina Institute for Advanced Materials and Technology University of Science and Technology BeijingBeijingChina Beijing Key Laboratory of Materials Genome Engineering University of Science and Technology BeijingBeijingChina

With scientific research in materials science becoming more data intensive and collaborative after the announcement of the Materials Genome Initiative,the need for modern data infrastructures that facilitate the sharing of materials data and analysis tools is compelling in the materials *** this paper,we describe the challenges of developing such infrastructure and introduce an emerging architecture with high *** call this architecture the Materials Genome engineering databases(MGED).MGED provides cloud-hosted services with features to simplify the process of collecting datasets from diverse data providers,unify data representation forms with user-centered presentation data model,and accelerate data discovery with advanced search *** also provides a standard service management framework to enable finding and sharing of tools for analyzing and processing *** describe MGED’s design,current status,and how MGED supports integrated management of shared data and services.

关键词： services service centered

来源：评论

学校读者我要写书评

暂无评论

Parallel generated method of transcriptional regulatory networks

Parallel generated method of transcriptional regulatory netw...

引用

作者： Liu, Shuai Ta, Na Lu, Mengye Liu, Gaocheng Bai, Weiling Li, Wenhui College of Computer Science Inner Mongolia University Hohhot010012 China Inner Mongolia Key Laboratory of Social Computing and Data Processing Hohhot010012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun130012 China College of Computer Science and Technology Jilin University Changchun130012 China

Generated method of transcriptional regulatory networks remains an important research in biology. Many approaches have been proposed to construct transcriptional regulatory networks. However, with the increase of ChIP-seq and RNA-seq data, the speed of constructing transcriptional regulation networks is still a challenge. Moreover, parallel computing lacks application in constructing gene regulatory networks through the analysis of the relationships between transcription factors (TFs) and target genes (TGs). Therefore, in this paper, a parallel generated method of transcriptional regulatory networks was proposed. First, two datasets, Michigan Cancer Foundation – 7 (MCF-7) and Cardiomyocytes (CM) were applied. Then, a parallel method was used to generate transcriptional regulatory network with their transcription factors (TFs) and target genes (TGs). Finally, experimental results showed that 61% regulatory relations in MCF-7 were validated in the Gene Expression Omnibus (GEO), while 29% results needed further experimental verification. Besides, 56% regulatory relations in CM were consistent with GEO, while 33% results were not yet verified. Furthermore, speed of parallel algorithm was faster than traditional serial algorithm in generating transcriptional regulatory networks. © 2018 John Wiley & Sons, Ltd.

关键词： Transcription factors

来源：评论

学校读者我要写书评

暂无评论

ATPRINPM: A single-source domain generalization method for the remaining useful life prediction of unknown bearings

ATPRINPM: A single-source domain generalization method for t...

引用

Sensing, Measurement & data Analytics in the era of Artificial Intelligence (ICSMD), International Conference on

作者： Juan Xu Bin Ma Yuqi Fan Xu Ding Key Laboratory of Knowledge Engineering with Big Data School of Computer and Information Hefei University of Technology Hefei China

The remaining useful life (RUL) of bearings is critical to the proper operation of mechanical equipment, maintenance of equipment costs and availability. The existing domain adaptation methods have had great success in RUL prediction. However, when the target bearing data are unavailable or unknown to be involved in model training, the domain adaptation approaches also incapable. To solve the problem, we propose a parallel reversible instance normalization method based on adaptive threshold stage division for remaining useful life prediction of unknown bearings. First, we design an adaptive threshold method to find degradation points to divide the healthy and degradation stages. Then according to time series, we merge the original vibration data and its instance normalized data to increase the data distribution diversity. Finally, we combine instance normalization and parallel reversible normalization of the source bearing data into unified RUL learning framework to solve the uncertainty of counterfactual data and improve RUL prediction performance. The results show that the method is superior to the state-of-the-art methods for RUL prediction of unknown bearings.

关键词： Degradation Vibrations Training Adaptation models Uncertainty data analysis Time series analysis

来源：评论

学校读者我要写书评

暂无评论

Top-K keyword search for supporting semantics in relational databases

引用

Ruan Jian Xue Bao/Journal of Software 2008年第9期19卷 2362-2375页

作者： Wang, Bin Yang, Xiao-Chun Wang, Guo-Ren College of Information Science and Engineering Northeastern University Shenyang 110004 China Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China Beijing 100872 China

In order to enhance the search results of keyword search in relational databases, semantic relationship among relations and tuples is employed and a semantic ranking function is proposed. In addition to considering current ranking principles, the proposed semantic ranking function provides new metrics to measure query relevance. Based on it, two Top-k search algorithms BA (blocking algorithm) and EBA (early-stopping blocking algorithm) are presented. EBA improves BA by providing a filtering threshold to terminate iterations as early as possible. Finally, experimental results show the semantic ranking function guarantees a search result with high precision and recall, and the proposed BA and EBA algorithms improve query performance of existing approaches.

关键词： Information retrieval

来源：评论

学校读者我要写书评

暂无评论

Deep Text Classification Can be Fooled

arXiv

引用

arXiv 2017年

作者： Liang, Bin Li, Hongcheng Su, Miaoqiang Bian, Pan Li, Xirong Shi, Wenchang School of Information Renmin University of China Beijing China Key laboratory of Data Engineering and Knowledge Engineering MOE Beijing China

In this paper, we present an effective method to craft text adversarial samples, revealing one important yet underestimated fact that DNN-based text classifiers are also prone to adversarial sample attack. Specifically, confronted with different adversarial scenarios, the text items that are important for classification are identified by computing the cost gradients of the input (white-box attack) or generating a series of occluded test samples (black-box attack). Based on these items, we design three perturbation strategies, namely insertion, modification, and removal, to generate adversarial samples. The experiment results show that the adversarial samples generated by our method can successfully fool both state-of-the-art character-level and word-level DNN-based text classifiers. The adversarial samples can be perturbed to any desirable classes without compromising their utilities. At the same time, the introduced perturbation is difficult to be perceived. Copyright © 2017, The Authors. All rights reserved.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

BeCFI: Detecting hidden control flow with performance monitoring counters

引用

International Journal of High Performance Computing and Networking 2016年第5-6期9卷 470-479页

作者： Zhou, Hong Wei Shi, Wen Chang Yuan, Jin Hui Li, Fu Lin Institute of Electronic Technology Information Engineering University Zhengzhou China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Renmin University of China Beijing China

Most of existing control flow integrity efforts target keeping intended control flow in good integrity. However, they fail to expose hidden control flow that may be introduced by the execution of rootkits, ROP gadgets, etc. To overcome the challenge, we propose an innovative approach BeCFI to detect hidden control flow based on cross-view principle. Since modern processors are capable of observing the execution of all branch instructions, BeCFI obtains the hardware view with the support of performance monitoring counters (PMCs). To obtain software view, we build a software-based counter by compiler-patching and binary-overwriting, and monitor the execution of branch instructions with software-based counters. If a control transfer only appears in hardware view, BeCFI considers that it is hidden control transfer. We have developed a prototype system on Intel x86 Linux kernel. Our evaluations show BeCFI is capable of detecting the hidden control flow introduced by kernel rootkits and ROP attacks. Furthermore our performance tests demonstrate that BeCFI incurs an acceptable overhead. Copyright © 2016 Inderscience Enterprises Ltd.

关键词： Malware

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：