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

Data classification mining of university mental health education resources based on global search algorithm

INTERNATIONAL JOURNAL OF COMPUTER APPLICATIONS IN TECHNOLOGY 2023年第4期73卷 278-287页

作者： Fang, Jing Wang, Daoxun Henan Polytech Marxism Coll Zhengzhou Henan Peoples R China Huanghe Sci & Technol Univ Vocat & Tech Coll Zhengzhou Henan Peoples R China

To solve the problems of low accuracy and recall rate, as well as long classification mining time in traditional methods, a university mental health education resource data classification mining method based on global search algorithm is proposed. Collect data on university mental health education resources, identify abnormal data using isolated forests and perform correction processing. Extract resource data features using Fisher discriminant criteria and select data features. Build a data classification mining model for university mental health education resources, and use the particle swarm optimisation algorithm in the global search algorithm to construct an optimisation objective function for classification mining. Input the data to be processed into the optimised model to obtain relevant classification mining results. The experimental results show that the proposed method has a mean classification mining accuracy of 98.1%, a mean recall rate of 97.3% and a classification mining time of less than 1.28 s.

关键词： global search algorithm university mental health education resource classification mining isolation forests fisher's discriminant criterion particle swarm optimisation algorithm

来源：评论

学校读者我要写书评

暂无评论

SVM Regression Parameters Optimization Using Parallel global search algorithm

SVM Regression Parameters Optimization Using Parallel Global...

引用

12th International Conference on Parallel Computing Technologies (PaCT)

作者： Barkalov, Konstantin Polovinkin, Alexey Meyerov, Iosif Sidorov, Sergey Zolotykh, Nikolai NI Lobachevsky State Univ Nizhni Novgorod Nizhnii Novgorod Russia

ISBN: (纸本)9783642399572;9783642399589

The problem of optimal parameters selection for the regression construction method using Support Vector Machine is stated. Cross validation error function is taken as the criterion. Arising bound constrained nonlinear optimization problem is solved using parallel global search algorithm by R. Strongin with a number of modifications. Efficiency of the proposed approach is demonstrated using model problems. A possibility of the algorithm usage on large-scale cluster systems is evaluated. Linear speed-up of combined parallel global search algorithm is demonstrated.

关键词： Machine learning global optimization support vector machine global search algorithm

来源：评论

学校读者我要写书评

暂无评论

LC-Grid: a linear global contact search algorithm for finite element analysis

引用

COMPUTATIONAL MECHANICS 2014年第5期54卷 1285-1301页

作者： Chen, Hu Lei, Zhou Zang, Mengyan Univ New S Wales Sch Engn & Informat Technol ADFA Canberra ACT 2600 Australia Los Alamos Natl Lab Geophys Grp Los Alamos NM 87545 USA S China Univ Technol Sch Mech & Automot Engn Guangzhou 510640 Guangdong Peoples R China

The contact searching is computationally intensive and its memory requirement is highly demanding;therefore, it is significant to develop an efficient contact search algorithm with less memory required. In this paper, we propose an efficient global contact search algorithm with linear complexity in terms of computational cost and memory requirement for the finite element analysis of contact problems. This algorithm is named LC-Grid (Lei devised the algorithm and Chen implemented it). The contact space is decomposed;thereafter, all contact nodes and segments are firstly mapped onto layers, then onto rows and lastly onto cells. In each mapping level, the linked-list technique is used for the efficient storing and retrieval of contact nodes and segments. The contact detection is performed in each non-empty cell along non-empty rows in each non-empty layer, and moves to the next non-empty layer once a layer is completed. The use of migration strategy makes the algorithm insensitive to mesh size. The properties of this algorithm are investigated and numerically verified to be linearly proportional to the number of contact segments. Besides, the ideal ranges of two significant scale factors of cell size and buffer zone which strongly affect computational efficiency are determined via an illustrative example.

关键词： Contact global search algorithm Space decomposition Finite element analysis

来源：评论

学校读者我要写书评

暂无评论

Improved Branch and Bound algorithm and an interpolation-based search algorithm for quadratic minimization with one negative eigenvalue

引用

OPTIMIZATION LETTERS 2025年第3期19卷 527-549页

作者： Salahi, M. Karbasy, S. Ansary Almaadeed, T. A. Hamdi, A. Univ Guilan Fac Math Sci Dept Appl Math Rasht Iran Univ Guilan Ctr Excellence Math Modeling Optimizat & Combinato Rasht Iran Qatar Univ Coll Arts & Sci Dept Math & Stat Math Program Doha Qatar

In the literature a Branch and Bound (BB) algorithm is proposed for solving the quadratic minimization problem featuring a negative eigenvalue, a problem renowned for its NP-hard nature. It involves partitioning the feasible set along a single concave variable and the utilization of a convex approximation for the objective function within each partition set, allowing for an acceptable degree of error. In this study, we initially put forth an enhanced version of the BB algorithm, accomplished by reformulating the problem as the minimization of the sum of a convex and concave univariate functions. This reformulation facilitates the removal of a portion of the partitioning interval, as we can efficiently identify the global minimum of the underlying function, consequently reducing the number of partitions required within the BB algorithm. We also propose a heuristic algorithm that involves interpolation of the non-explicitly provided convex component. Subsequently, we compute the approximate univariate function at a significant number of points, and in the vicinity of their minima, we select an interval in which to search for the global minimum. Computational experiments are presented, featuring a variety of examples, to demonstrate the effectiveness of the proposed algorithms in comparison to both the BB algorithm and the global search algorithm in the literature.

关键词： Quadratic program Negative eigenvalue Branch and Bound global search algorithm

来源：评论

学校读者我要写书评

暂无评论

global search and Analysis for the Nonconvex Two-Level l1 Penalty

引用

IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS 2024年第3期35卷 3886-3899页

作者： He, Fan He, Mingzhen Shi, Lei Huang, Xiaolin Shanghai Jiao Tong Univ MOE Key Lab Syst Control & Informat Proc Inst Image Proc & Pattern Recognit Shanghai 200240 Peoples R China Shanghai Jiao Tong Univ Inst Med Robot Shanghai 200240 Peoples R China Fudan Univ Sch Math Sci Shanghai Key Lab Contemporary Appl Math Shanghai 200433 Peoples R China Shanghai Artificial Intelligence Lab Shanghai 200232 Peoples R China

Imposing suitably designed nonconvex regularization is effective to enhance sparsity, but the corresponding global search algorithm has not been well established. In this article, we propose a global search algorithm for the nonconvex twolevel P t penalty based on its piecewise linear property and apply it to machine learning tasks. With the search capability, the optimization performance of the proposed algorithm could be improved, resulting in better sparsity and accuracy than most state-of-the-art global and local algorithms. Besides, we also provide an approximation analysis to demonstrate the effectiveness of our global search algorithm in sparse quantile regression.

关键词： Compressive sensing global search algorithm kernel-based quantile regression nonconvex optimization two-level l(1) penalty

来源：评论

学校读者我要写书评

暂无评论

Testing the R-strategy for a reverse convex problem

引用

JOURNAL OF global OPTIMIZATION 1998年第1期13卷 61-74页

作者： Strekalovsky, AS Tsevendorj, I Irkutsk State Univ Irkutsk 664003 3 Russia

This paper is devoted to solving a reverse-convex problem. The approach presented here is based on global Optimality Conditions. We propose a general conception of a global search algorithm and develop each part of it... 详细信息

关键词： global optimization global optimality conditions global search algorithm

来源：评论

学校读者我要写书评

暂无评论

On solving the sum-of-ratios problem

引用

APPLIED MATHEMATICS AND COMPUTATION 2018年 318卷 260-269页

作者： Gruzdeva, Tatiana V. Strekalovsky, Alexander S. Russian Acad Sci Matrosov Inst Syst Dynam & Control Theory Siberian Branch Lermontov St 134 Irkutsk 664033 Russia

This paper addresses the development of efficient global search methods for fractional programming problems. Such problems are, in general, nonconvex (with numerous local extremums) and belong to a class of global optimization problems. First, we reduce a rather general fractional programming problem with d.c. functions to solving an equation with a vector parameter that satisfies some nonnegativity assumption. This theorem allows the justified use of the generalized Dinkelbach's approach for solving fractional programming problems with a d.c. goal function. Based on solving of some d.c. minimization problem, we developed a global search algorithm for fractional programming problems, which was tested on a set of low-dimensional test problems taken from the literature as well as on randomly generated problems with up to 200 variables or 200 terms in the sum. (C) 2017 Elsevier Inc. All rights reserved.

关键词： Fractional optimization Nonconvex optimization Difference of convex functions Equation with vector parameter global search algorithm

来源：评论

学校读者我要写书评

暂无评论

Attractive force search algorithm for piecewise convex maximization problems

引用

OPTIMIZATION LETTERS 2012年第7期6卷 1317-1333页

作者： Fortin, Dominique Tseveendorj, Ider Univ Versailles Lab PRiSM F-78035 Versailles France INRIA F-78153 Le Chesnay France

We consider mathematical programming problems with the so-called piecewise convex objective functions. A solution method for this interesting and important class of nonconvex problems is presented. This method is based on Newton's law of universal gravitation, multicriteria optimization and Helly's theorem on convex bodies. Numerical experiments using well known classes of test problems on piecewise convex maximization, convex maximization as well as the maximum clique problem show the efficiency of the approach.

关键词： global search algorithm Local search algorithm Nonconvex optimization Convex maximization Piecewise convex maximization

来源：评论

学校读者我要写书评

暂无评论

Piece adding technique for convex maximization problems

引用

JOURNAL OF global OPTIMIZATION 2010年第4期48卷 583-593页

作者： Fortin, Dominique Tseveendorj, Ider Univ Versailles Lab PRiSM F-78035 Versailles France INRIA F-78153 Le Chesnay France

In this article we provide an algorithm, where to escape from a local maximum y of convex function f over D, we (locally) solve piecewise convex maximization max{min{f (x) - f (y), p (y) (x)} | x is an element of D} with an additional convex function p (y) (center dot). The last problem can be seen as a strictly convex improvement of the standard cutting plane technique for convex maximization. We report some computational results, that show the algorithm efficiency.

关键词： global search algorithm Local search algorithm Nonconvex optimization Convex maximization Piecewise convex maximization

来源：评论

学校读者我要写书评

暂无评论

Uncertainties in finite-fault slip inversions: To what extent to believe? (A critical review)

引用

BULLETIN OF THE SEISMOLOGICAL SOCIETY OF AMERICA 2003年第6期93卷 2445-2458页

作者： Beresnev, IA Iowa State Univ Sci & Technol Dept Geol & Atmospher Sci Ames IA 50011 USA

The matrix inversion of seismic data for slip distribution on finite faults is based on the formulation of the representation theorem as a linear inverse problem. The way the problem is posed and parameterized involves substantial, and often subjective, decision making. This introduces several levels of uncertainty, some of them recognized and some not adequately addressed. First, the inverse problem must be numerically stabilized and geologically constrained to obtain meaningful solutions. It is known that geologically irrelevant solutions also exist that may even better fit the data. It is also known that obtaining a stabilized, constrained solution compatible with the data does not guarantee that it is close to the true slip. Second, once the scheme has been set up, there still remains significant uncertainty in seismological parameterization. Synthetic tests have consistently shown that incorrect assumptions about the parameters fixed in the inversions, such as the rupture speed, fault geometry, or crustal structure, generate geologic artifacts, which are also dependent on array geometry. Third, solving the inverse problem involves numerical approximation of a continuous integral, with the generally grid-dependent result. Fourth, maintaining a linear inverse problem requires that the final slip on each subfault be the only variable to solve for. The slip functions used in the inversions are typically integrals of triangles or boxcars;they all involve a second parameter, slip duration, which has to be fixed. The effect of chosen duration cannot be disregarded, especially when frequencies higher than 0.1-0.5 Hz in the data are modeled. Fifth, the spectra of triangles and boxcars are sine functions, whose relevance to realistically observed spectra is problematic. How close then could an inverted slip image be to the true one? There are reasons to believe that the fine structure resolved is often an artifact, dependent on the choice of a particular inversion scheme

关键词： Imperial-valley earthquake global search algorithm Ken nanbu earthquake August 1999 izmit Strong-motion Resolution analysis Rupture history Temporal distribution Domain inversion Ground motions

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：