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

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

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

引用

3rd International Conference on Sensing, Measurement and data Analytics in the Era of Artificial Intelligence, ICSMD 2022

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

ISBN: (纸本)9781665492812

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. © 2022 IEEE.

关键词： Adaptive Threshold Reversible Instance Normalization RUL Prediction Stage Division

来源：评论

学校读者我要写书评

暂无评论

Meta-path Enhanced knowledge Graph Convolutional Network for Recommender Systems 12

Meta-path Enhanced Knowledge Graph Convolutional Network for...

引用

12th IEEE International Conference on Big knowledge, ICBK 2021

作者： Wang, Ru Wu, Meng Ji, Shengwei Hefei University of Technology Key Laboratory of Knowledge Engineering With Big Data Ministry of Education School of Computer Science and Information Engineering Hefei China

ISBN: (纸本)9781665438582

knowledge Graph (KG) is a directed heterogeneous information network that contains a large number of entities and relations, which is widely used as effective side information in rec-ommender systems. Moreover, in recommender systems, the Graph Convolutional Network (GCN) model is introduced to mine the relatedness between entities in a KG because of its efficiency in extracting spatial features on topological graphs. The knowledge Graph Convolutional Network (KGCN) model up-dates the embedding of a currently positioned entity by aggregating the information of adjacent entities selected randomly. Never-theless, it has two limititations: 1) the information of neighbors se-lected randomly cannot accurately represent the current entity in the KG;2) the model is hard to converge as graph features (i.e. The spatial relation features and semantic information features of en-tities in the KG) grow. To solve these limitations, in this paper, a meta-path (i.e., a sequence of artificially constructed relationships) is introduced into the selection of neighbors in the KGCN model to enhance the representation of each entity. Furthermore, two construction methods of the meta-path - constructing a meta-path based on the same relation (KGCN-SP) and the characteris-tics of KG (KGCN-MP) -are proposed. The experiments based on three real-world datasets demonstrate that the neighbor selection based on the meta-path is able to collect more accurate infor-mation from a KG and improve the recommendation performance effectively. © 2021 IEEE.

关键词： knowledge graph

来源：评论

学校读者我要写书评

暂无评论

LOB: Bucket based index for range queries

LOB: Bucket based index for range queries

引用

9th International Conference on Web-Age Information Management, WAIM 2008

作者： Wang, Jieping Du, Xiaoyong Key Laboratory of Data Engineering and Knowledge Engineering MOE Beijing 100872 China School of Information Renmin University of China Beijing 100872 China

ISBN: (纸本)9780769531854

database-as-a-Service is a promising data management paradigm in which data is encrypted before being sent to the untrusted server. Efficient querying on encrypted data is a performance critical problem which has various solutions, among which bucket based index is an effective and flexible one. In previous research some metrics are proposed to measure security and efficiency. In this paper, we illustrate by example the limitations of these metrics and introduce a new security metric based on probability distribution variance and efficiency metric based on overlapping ratio. Based on these metrics we propose a local overlapping bucket algorithm (LOB) with time complexity of O(nlogn), where n represents the cardinality of the table. Experiments on synthetic and real dataset show that our algorithm can achieve higher security by trading off efficiency. © 2008 IEEE.

关键词： Information management

来源：评论

学校读者我要写书评

暂无评论

FARP: Mining fuzzy association rules from a probabilistic quantitative database

FARP: Mining fuzzy association rules from a probabilistic qu...

引用

作者： Pei, Bin Zhao, Suyun Chen, Hong Zhou, Xuan Chen, Dingjie Key Laboratory of Data Engineering and Knowledge Engineering MOE Beijing 100872 China School of Information Renmin University of China Beijing 100872 China

Current studies on association rule mining focus on finding Boolean/quantitative association rules from certain databases or Boolean association rules from probabilistic databases. However, little work on mining association rules from probabilistic quantitative databases has been mentioned because the simultaneous measurement of quantitative information and probability is difficult. By introducing a novel Shannon-like Entropy, we aggregate and measure the information contained in an item with the coexistence of fuzzy uncertainty hidden in quantitative values and random uncertainty. We then propose Support and Confidence metrics for a fuzzy-probabilistic database to quantify association rules. Finally, we design an algorithm, called FARP (mining Fuzzy Association Rules from a Probabilistic quantitative data), to discover frequent fuzzy-probabilistic itemsets and fuzzy association rules using the proposed interest measures. The experimental results show the effectiveness of our method and its practicality in real-world applications. © 2013 Elsevier Inc. All rights reserved.

关键词： Entropy

来源：评论

学校读者我要写书评

暂无评论

Fault-tolerant routing: κ-inconnected many-to-one routing in wireless networks

Fault-tolerant routing: κ-inconnected many-to-one routing i...

引用

3rd International Conference on Combinatorial Optimization and Applications, COCOA 2009

作者： Li, Deying Zhu, Qinghua Yang, Huiqiang School of Information Renmin University of China Beijing China Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China MOE China

ISBN: (纸本)3642020259

This paper addresses the problem of fault-tolerant many-to-one routing in static wireless networks with asymmetric links, which is important in both theoretical and practical aspects. The problem is to find a minimum energy subgraph for a given subset and a destination node such that there are κ node-disjoint paths from each node in the subset to the destination node in the subgraph. We prove that the problem is NP-hard, and propose two efficient heuristic approaches, namely, the minimum weight κ node-disjoint paths based (MWkNDPB) approach and the minimum energy κ node-disjoint paths based (MEkNDPB) approach. Extensive simulations have been conducted to show that proposed algorithms are efficient. © 2009 Springer Berlin Heidelberg.

关键词： Wireless networks

来源：评论

学校读者我要写书评

暂无评论

Research progress of CDT 8

Research progress of CDT

引用

8th International Conference on Bioinformatics and Biomedical Science, ICBBS 2019

作者： Yuting, Gao Shutong, Shen Sanhong, Deng School of Information Management Nanjing University China Key Laboratory of Data Engineering and Knowledge Services in Jiangsu China

ISBN: (纸本)9781450372510

With the high mortality rate for the cases of malignant tumors, the discovery and early treatment of cancer is critical to improving the 5-year survival rate of cancer. The biggest challenge in control and prevention is how to detect tumors as early as possible, so that the most effective means can be used for treatment. With the help of the WOS database, researchers found that liquid biopsy, genetic material/protein expression and computer imaging play an important role in cancer detection. Through analysis of the history and current status of cancer detection technology development, this paper also aims to provide guidance for the clinical practice of current cancer screening and provide inspiration for future technological development. © 2019 Association for Computing Machinery.

关键词： Gene expression

来源：评论

学校读者我要写书评

暂无评论

IDIDNG: A Domain Generalization Remaining Useful Life Prediction Method of Unknown Bearings 3

IDIDNG: A Domain Generalization Remaining Useful Life Predic...

引用

3rd International Conference on Sensing, Measurement and data Analytics in the Era of Artificial Intelligence, ICSMD 2022

作者： Xu, Juan Xu, Zhen Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data School of Computer and Information Hefei China

ISBN: (纸本)9781665492812

Domain adaptation (DA) -based RUL prediction methods have achieved great success for the adaptation ability of the distribution discrepancy between the source and target domains. However, DA methods are powerless when the target domain data are not available for training. To solve this problem, we propose an inter-domain intra-domain normalized generalization (IDIDNG) network, which consists of three modules, respectively, the pre-processing module, the feature transformation module, and the RUL prediction module. First, we design the pre-processing module to process the bearing vibration data with peak-to-peak and Z-score. Finally, it is connected into a four-dimensional array. In the feature transformation module, via intra-domain and inter-domain normalization as well as mean-variance cross-swap, we transform the data distribution expressions of invariant features of bearings from the perspective of different bearings and different degradation stage of one bearing, such that the model enables to learn the intra-domain and inter-domain discrepancy. Further we design four adaptable weighting parameters into the intra-domain normalization to learn the appropriate normalized mean and variance via the model training. Finally, we design the GRU-based RUL prediction module to predict the unknown bearings. We conducted experiments under the PHM2012 dataset, experimental results show that our method achieves satisfactory prediction accuracy in the unknown bearings. © 2022 IEEE.

关键词： adaptive weights cross-swap generalization inter-domain intra-domain normalization RUL

来源：评论

学校读者我要写书评

暂无评论

ASAWA: An automatic partition key selection strategy

ASAWA: An automatic partition key selection strategy

引用

15th Asia-Pacific Web Conference on Web Technologies and Applications, APWeb 2013

作者： Wang, Xiaoyan Chen, Jinchuan Du, Xiaoyong School of Information Renmin University of China China School of Information and Electrical Engineering Ludong University China Key Laboratory of Data Engineering and Knowledge Engineering MOE China

ISBN: (纸本)9783642374005

With the rapid increase of data volume, more and more applications have to be implemented in a distributed environment. In order to obtain high performance, we need to carefully divide the whole dataset into multiple partitions and put them into distributed data nodes. During this process, the selection of partition key would greatly affect the overall performance. Nevertheless, there are few works addressing this topic. Most previous projects on data partitioning either utilize a simple strategy, or rely on a commercial database system, to choose partition keys. In this work, we present an automatic partition key selection strategy called ASAWA. It chooses partition keys according to the analysis on both dataset and workload schemas. In this way, intimate tuples, i.e. co-appearing in queries frequently, would be probably put into the same partition. Hence the cross-node joins could be greatly reduced and the system performance could be improved. We conduct a series of experiments over the TPC-H datasets to illustrate the effectiveness of the ASAWA strategy. © 2013 Springer-Verlag.

关键词： data handling

来源：评论

学校读者我要写书评

暂无评论

Search result diversification based on hierarchical intents 15

Search result diversification based on hierarchical intents

引用

24th ACM International Conference on Information and knowledge Management, CIKM 2015

作者： Hu, Sha Dou, Zhicheng Wang, Xiaojie Sakai, Tetsuya Wen, Ji-Rong Beijing Key Laboratory of Big Data Management and Analysis Methods China Key Laboratory of Data Engineering and Knowledge Engineering MOE China School of Information Renmin University of China China Waseda University Japan

ISBN: (纸本)9781450337946

A large percentage of queries issued to search engines are broad or ambiguous. Search result diversification aims to solve this problem, by returning diverse results that can fulfill as many different information needs as possible. Most existing intent-aware search result diversification algorithms formulate user intents for a query as a flat list of subtopics. In this paper, we introduce a new hierarchical structure to represent user intents and propose two general hierarchical diversification models to leverage hierarchical intents. Experimental results show that our hierarchical diversification models outperform state-of-the-art diversification methods that use traditional flat subtopics. © 2015 ACM.

关键词： Search engines

来源：评论

学校读者我要写书评

暂无评论

Online Streaming Features Causal Discovery Algorithm Based on Partial Rank Correlation

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2023年第1期4卷 197-208页

作者： Yang, Jing Jiang, Liufeng Shen, Anbo Wang, Aiguo Key Laboratory of Knowledge Engineering with Big Data of Ministry of Education Hefei University of Technology Hefei230009 China School of Computer Science and Information Engineering Hefei University of Technology Hefei230009 China School of Electronic and Information Engineering Foshan University Foshan528011 China

Aimedat the problem of dynamic causal discovery in the era of artificial intelligence, this article combines partial rank correlation coefficients and streaming features in the field of Bayesian network structure learning and proposes a new online streaming feature causal discovery algorithm based on partial rank correlation named the partial rank casual discovery streaming feature based algorithm. This algorithm is not only suitable for Bayesian causal structure learning in dynamic feature spaces generated by sequential streams of features but can also effectively process multivariate linear Gaussian and nonlinear non-Gaussian data. We present three main contributions. First, for arbitrarily distributed datasets, which can be generated by the additive noise model, we proved that the partial rank correlation coefficient can be used as the criterion for the conditional independence test and explored the distribution of corresponding statistics. Second, the PCSDSF algorithm redefined the relevance based on partial rank statistic prospects and then redefined conditional dependence or independence. This method can significantly reduce the number of conditional independence tests and achieves a good time performance. Finally, theoretical analysis and several experiments proved the reliability of the algorithm. A simulation showed that on average, the PCSDSF algorithm outperforms existing algorithms in terms of both the accuracy and time performance. © 2022 IEEE.

关键词： Additive noise

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：