CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
平滑支持向量机聚类研究
Authors
席斌
李传宗
耿代
Publication date
1 March 2008
Publisher
Abstract
支持向量聚类(Support Vector Clustering,SVC)的运算有较高的计算复杂性,本文在优化过程中引入惩罚函数,以此作为目标函数的惩罚项,并用一个平滑函数来近似正号函数,并将优化问题的不等式约束消去,得到一个无约束问题。再利用BFGS-Armijo算法来求解该无约束问题。理论和仿真结果表明该方法提高优化问题的求解效率
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Xiamen University Institutional Repository
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:dspace.xmu.edu.cn:2288/156...
Last time updated on 10/06/2020