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

2011 8th IEEE International Conference on e-Business engineering, ICEBE 2011

作者： Xu, Wei Zheng, Tingting Li, Ziang Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China Ministry of Education Beijing 100872 China School of Information Renmin University of China Beijing 100872 China

ISBN: (纸本)9780769545189

Unemployment rate prediction has become critically important, because it can help government to make decision and design policies. In recent years, forecast of unemployment rate attracts much attention from governments, organizations, and research institutes, and researchers. Recently, a novel method using search engine query data to forecast unemployment was proposed by scholars. In this paper, a data mining based framework using web information is introduced for unemployment rate prediction. Under the framework, a neural network method, as one of the most effective data mining tools, is developed to forecast unemployment trend using search engine query data. In the proposed method, search engine query data related with employment activities is firstly found. Secondly, feature selection models including correlation coefficient method and genetic algorithm are constructed to reduce the dimension of the query data. Thirdly, various neural networks are employed to model the relationship between unemployment rate data and query data. Fourthly, an optimal neural network is selected as the selective predictor by using the cross-validation method. Finally, the selective neural network predictor with the best feature subset is used to forecast unemployment trend. The empirical results show that the proposed method clearly outperforms the classical forecasting approaches for the unemployment rate prediction. These findings imply that data mining method, such as neural networks, together with web information, can be used as an alternative tool to forecast social/economic hotspot. © 2011 IEEE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

H-tree: A hybrid structure for confidence computation in probabilistic databases

引用

14th Asia Pacific Web Technology Conference, APWeb 2012

作者： Zhang, Qian Qin, Biao Wang, Shan Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China Ministry of Education Beijing 100872 China School of Information Renmin University of China Beijing 100872 China

ISBN: (纸本)9783642292521

Probabilistic database has become a popular tool for uncertain data management. Most work in the area is focused on efficient query processing and has two main directions, accurate or approximate evaluation. In recent work for conjunctive query without self-joins on a tuple-independent probabilistic database, query evaluation is equivalent to computing marginal probabilities of boolean formulas associated with query results. If formulas can be factorized into a read-once form where every variable appears at most once, confidence computation is reduced to a tractable problem that can be evaluated in linear time. Otherwise, it is regarded as a NP-hard problem and need to be evaluated approximately. In this paper, we propose a framework that evaluates both tractable and NP-hard conjunctive queries efficiently. First, we develop a novel structure H-tree, where boolean formulas are decomposed to small partitions which are either read-once or NP-hard. Then we propose algorithms for building H-tree and parallelizing (approximate) confidence computation. We also propose fundamental theorems to ensure the correctness of our approaches. Performance experiments demonstrate the benefits of H-tree, especially for approximate confidence evaluation on NP-hard queries. © 2012 Springer-Verlag Berlin Heidelberg.

关键词： Query processing

来源：评论

学校读者我要写书评

暂无评论

An extended system method for consistent fundamental matrix estimation

An extended system method for consistent fundamental matrix ...

引用

International Conference on Intelligent Computing, ICIC 2005

作者： Zhong, Huixiang Feng, Yueping Pang, Yunjie Key Laboratory of Symbol Computation and Knowledge Engineering Jilin University Ministry of Education Changchun 130012 China

ISBN: (纸本)9783540282266

This paper is concerned with solution of the consistent fundamental matrix estimation in a quadratic measurement error model. First an extended system for determining the estimator is proposed, and an efficient implementation for solving the system-a continuation method is developed to fix on an interval in which a local minimum belongs. Then an optimization method using a quadratic interpolation is used to exactly locate the minimum. The proposed method avoids solving total eigenvalue problems. Thus the computational cost is significantly reduced. Synthetic and real images are used to verify and illustrate the effectiveness of the proposed approach. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Computer systems

来源：评论

学校读者我要写书评

暂无评论

Boosting few-shot point cloud segmentation with intra-class correlation and iterative prototype fusion

引用

Computer Vision and Image Understanding 2025年 258卷

作者： Zhang, Xindan Li, Ying Zhang, Xinnian College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China of Information and Communication Technology Ajou University Korea Republic of

Semantic segmentation of 3D point clouds is often limited by the challenge of obtaining labeled data. Few-shot point cloud segmentation methods, which can learn previously unseen categories, help reduce reliance on labeled datasets. However, existing methods are susceptible to correlation noise and suffer from significant discrepancies between support prototypes and query features. To address these issues, we first introduce an intra-class correlation enhancement module for filtering correlation noise driven by inter-class similarity and intra-class diversity. Second, to better represent the target classes, we propose an iterative prototype fusion module that adapts the query point cloud feature space, mitigating the problem of object variations in the support set and query set. Extensive experiments on S3DIS and ScanNet benchmark datasets demonstrate that our approach achieves competitive performance with state-of-the-art methods. © 2025 Elsevier Inc.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

Layer-Wise Learning Rate Optimization for Task-Dependent Fine-Tuning of Pre-Trained Models: An Evolutionary Approach

引用

ACM Transactions on Evolutionary Learning and Optimization 2024年第4期4卷 1-23页

作者： Bu, Chenyang Liu, Yuxin Huang, Manzong Shao, Jianxuan Ji, Shengwei Luo, Wenjian Wu, Xindong Key Laboratory of Knowledge Engineering with Big Data Ministry of Education and School of Computer Science and Information Engineering Hefei University of Technology Hefei China School of Artificial Intelligence and Big Data Hefei University Hefei China Guangdong Provincial Key Laboratory of Novel Security Intelligence Technologies School of Computer Science and Technology Harbin Institute of Technology Shenzhen China

The superior performance of large-scale pre-Trained models, such as Bidirectional Encoder Representations from Transformers (BERT) and Generative Pre-Trained Transformer (GPT), has received increasing attention in both academic and industrial research and has become one of the current research hotspots. A pre-Trained model refers to a model trained on large-scale unlabeled data, whose purpose is to learn general language representation or features for fine-Tuning or transfer learning in subsequent tasks. After pre-Training is complete, a small amount of labeled data can be used to fine-Tune the model for a specific task or domain. This two-stage method of "pre-Training+fine-Tuning"has achieved advanced results in natural language processing (NLP) tasks. Despite widespread adoption, existing fixed fine-Tuning schemes that adapt well to one NLP task may perform inconsistently on other NLP tasks given that different tasks have different latent semantic structures. In this article, we explore the effectiveness of automatic fine-Tuning pattern search for layer-wise learning rates from an evolutionary optimization perspective. Our goal is to use evolutionary algorithms to search for better task-dependent fine-Tuning patterns for specific NLP tasks than typical fixed fine-Tuning patterns. Experimental results on two real-world language benchmarks and three advanced pre-Training language models show the effectiveness and generality of the proposed framework. © 2024 held by the owner/author(s).

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

data-Driven Fault Compensation Tracking Control for Coupled Wastewater Treatment Process

引用

IEEE/CAA Journal of Automatica Sinica 2023年第1期10卷 294-297页

作者： Peihao Du Weimin Zhong Xin Peng Linlin Li Zhi Li the Key Laboratory of Smart Manufacturing in Energy Chemical Process Ministry of EducationEast China University of Science and TechnologyShanghai 200237China IEEE the Key Laboratory of Knowledge Automation for Industrial Processes of Ministry of Education the School of Automation and Electrical EngineeringUniversity of Science and Technology BeijingBeijing 100083China

Dear Editor, This letter is concerned with the data-driven fault compensation tracking control for a coupled wastewater treatment process(WWTP)subject to sensor faults. Invariant set theory is introduced to eliminate the completely bounded and differentiable conditions of coupled non-affine dynamics and to explicitly express the control *** adaptive fault compensation mechanism is constructed to accommodate the effects of sensor faults. By employing a cubic absolutevalue Lyapunov criteria。

关键词： differentiable eliminate absolute

来源：评论

学校读者我要写书评

暂无评论

Optimizing queries with expensive video predicates based on estimation of attribute cardinality

Optimizing queries with expensive video predicates based on ...

引用

International Conference on Multimedia Information Networking and Security

作者： Yu, Lisheng Zhang, Jianmei Wang, Shan Key Laboratory of Ministry of Education for Data Engineering and Knowledge Engineering Renmin University of China Beijing 100872 China School of Information Renmin University of China Beijing 100872 China

ISBN: (纸本)9780769542584

With rapid advances in video processing technologies, video data increased rapidly and becomes popular in our daily life for both professional and consumer applications, e.g., surveillance, education, entertainment. Such needs require the data management system not only can store and access the video content, but also able to optimize the queries with expensive video predications in an effective and efficient way. In previous research literature, query optimizations in relational database systems (RDBMS) are often based on disk I/O cost of involved operations. However, for a query that contains expensive video predicates, traditional cost estimation model does not work well. Although researchers have proposed some approaches which can solve the problem in certain situations, there are still some unresolved issues, and it needs further optimization. In this paper, motivate from a real-world large supermarket's business data and video surveillance data management scenario, through considering the characteristics of video data and its expensive processing, we propose a novel query optimization approach that caches operators' results and reconstructs the join order based estimation for attribute cardinality. This approach reduces the invoking times of expensive video predicate in a greater degree and gives a better solution for mixed query optimization which contains traditional data types and large object operations. The experiment result is satisfactory while compare with existing expensive predicates query optimization methods. © 2010 IEEE.

关键词： Relational database systems

来源：评论

学校读者我要写书评

暂无评论

RETRACTED ARTICLE: Studies of knowledge management methods from literature

RETRACTED ARTICLE: Studies of knowledge management methods f...

引用

作者： Zhang, Jing Ye, Liuqi Business School of Hohai University Nanjing Jiangsu 210098 China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Renmin University of China Beijing 100872 China

ISBN: (纸本)9781424469291

knowledge management methods reflect ways to undertake knowledge management objectives and actions taken for implementation. However, little has been written on the topic. The paper summarizes main topics of knowledge management methods from literature, including research contents, management methods, main types, objects involved, study domains, perspectives, objectives and tasks, school and achieving channels, developing trends and knowledge management methodology and etc. © 2010 IEEE.

关键词： knowledge management

来源：评论

学校读者我要写书评

暂无评论

The internet of things and personal privacy protection

The internet of things and personal privacy protection

引用

2010 International Conference of Logistics engineering and Management: Logistics for Sustained Economic Development - Infrastructure, Information, Integration, ICLEM 2010

作者： Zhang, Jing Ye, Liuqi Business School Hohai University Nanjing Jiangsu 210098 China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Renmin University of China Beijing 100872 China

ISBN: (纸本)9780784411391

Protecting personal privacy and its right are a respect for the human rights, the necessary condition for healthy development of a democratic society and the important criteria of maintaining the basic dignity to be human. The internet of things with its ubiquitous data-aware and intelligent information processing capabilities, improves social efficiency and severe challenges for information security and privacy. In this environment, how to ensure information security and privacy are a major breakthrough in one of the obstacles and an important issue that must be addressed and resolved in the developing process of the internet of things. Thus, in the development of it, we should follow the basic principles of protecting personal privacy such as the entire management, legal compliance, security, adding information, balance and accountability, and establish such models of protecting personal privacy as laws, industry self-regulation and technology to fully protect the inviolability of personal privacy, and remove obstacles and barriers for the applications of the internet of things. © 2010 ASCE.

关键词： Logistics

来源：评论

学校读者我要写书评

暂无评论

DRLO: Optimizing edge server placement in dynamic MEC scenarios using deep reinforcement learning

引用

Computer Networks 2025年 268卷

作者： Yingya Guo Cen Chen College of Computer and Data Science Fuzhou University PR China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University PR China Engineering Research Center of Big Data Intelligence Ministry of Education Fujian PR China

As an emerging computing paradigm, Mobile Edge Computing (MEC) significantly enhances user experience and alleviates network congestion by strategically deploying edge servers in close proximity to mobile users. However, the effectiveness of MEC hinges on the precise placement of these edge servers, a critical factor in determining the Quality of Experience (QoE) for mobile users. While existing studies predominantly focus on optimizing edge server placement in static scenarios, they often fall short when faced with user mobility, resulting in a degradation of QoE. To address this challenge, we propose an adaptive edge server placement approach that leverages Deep Reinforcement Learning (DRL) to select the base stations for placing edge servers in a dynamic MEC environment. Our objective is to minimize access delay by optimizing edge server placement for adapting to dynamic environment. To tackle the vast action space associated with edge server placement, we introduce a novel activation function in the actor neural network for efficient exploration. Furthermore, to enhance the adaptability of the derived edge server placement strategy, we meticulously design a new reward function, which takes into account the minimization of total access delay within dynamic MEC scenarios. Finally, to validate the effectiveness of our proposed method, extensive experiments were conducted using the Shanghai Telecom dataset. The results demonstrate that our approach outperforms baseline methods in minimizing access delay for users in dynamic MEC scenarios.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：