设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
GSW全文库(256)
地学标准(1)
万方学术会议(8)
CNKI期刊论文0611(283)
中国地质文献-英文(105)
Springer电子图书(1159)
CNKI会议论文(108)
知网期刊论文(60685)
馆藏书目(14)
院士团队服务(7)
CNKI学位论文(44427)
万方学位论文(21)
在“
Elsevier电子期刊
”中,
命中:
21,803
条,耗时:小于0.01 秒
在所有数据库中总计命中:
107,074
条
1.
Multi-view fuzzy
clustering
with minimax optimization for effective
clustering
of data from multiple sources
作者:
Yangtao Wang
;
a
;
wangyt@i2r.a-star.edu.sg
;
Lihui Chen
b
;
ELHCHEN@ntu.edu.sg
关键词:
Multi-view
clustering
;
Fuzzy
clustering
;
Soft
clustering
;
Minimax optimization
刊名:Expert Systems with Applications
出版年:2017
2.
A
clustering
algorithm for stream data with LDA-based unsupervised localized dimension reduction
作者:
Sirisup Laohakiat
;
sirisup.l@gmail.com
;
Suphakant Phimoltares
;
Chidchanok Lursinsap
关键词:
Stream data
clustering
;
Dimension reduction
;
Linear discriminant analysis
;
Clustering
algorithm
;
Linear discriminant analysis subspace
刊名:Information Sciences
出版年:2017
3.
Supervised Adaptive Incremental
Clustering
for data stream of chunks
作者:
Laiwen ZhengAuthor Vitae
;
Hong Huo
;
huohong@sjtu.edu.cn
Author Vitae
;
Yiyou GuoAuthor Vitae
;
Tao FangAuthor Vitae
关键词:
Automatic
clustering
;
Adaptive update
;
Classification
;
Data stream of chunks
;
Supervised
clustering
刊名:Neurocomputing
出版年:2017
4.
Dual soft assignment
clustering
algorithm for human action video
clustering
作者:
Minyoung Kim
mikim21@gmail.com
关键词:
Dual assignment
clustering
;
Unsupervised learning
;
Optimization
;
Human activity recognition
刊名:Computer Vision and Image Understanding
出版年:2017
5.
A K-partitioning algorithm for
clustering
large-scale spatio-textual data
作者:
Dong-Wan Choi
a
;
dongwanc@sfu.ca
;
Chin-Wan Chung
b
;
c
;
chung_cw@kaist.ac.kr
关键词:
Spatio-textual similarity
;
K-means
clustering
;
K-medoids
clustering
;
K-prototypes
clustering
;
Expected distance
;
Grid partitioning
刊名:Information Systems
出版年:2017
6.
Locality-constrained nonnegative robust shape interaction subspace
clustering
and its applications
作者:
Bo Li
a
;
bolimath@gmail.com" class="auth_mail" title="E-mail the corresponding author
Author Vitae
;
Chunyuan Lu
a
Author Vitae
;
Zhijie Wen
b
Author Vitae
;
Chengcai Leng
a
Author Vitae
;
Xiuping Liu
c
Author Vitae
关键词:
Shape interaction matrix
;
Subspace
clustering
;
Motion segmentation
;
Handwritten digit
clustering
刊名:Digital Signal Processing
出版年:2017
7.
KNCM: Kernel Neutrosophic c-Means
Clustering
作者:
Yaman Akbulut
a
;
Abdulkadir Şengü
;
r
a
;
Yanhui Guo
b
;
Kemal Polat
c
;
kemal_polat2003@yahoo.com
关键词:
Data
clustering
;
Fuzzy
clustering
;
Neutrosophic c-means
;
Kernel function
刊名:Applied Soft Computing
出版年:2017
8.
Sentence level matrix representation for document spectral
clustering
作者:
Ví
;
ctor Mijangos
;
a
;
vmijangosc@iingen.unam.mx
;
Gerardo Sierra
a
;
Azucena Montes
b
关键词:
Natural language analysis
;
Information retrieval
;
Graph-based
clustering
;
Document processing
;
Spectral
clustering
;
Frobenius metric
;
Doc2Vec
刊名:Pattern Recognition Letters
出版年:2017
9.
Active function Cross-Entropy
Clustering
作者:
P. Spurek
;
przemyslaw.spurek@ii.uj.edu.pl
;
J. Tabor
jacek.tabor@uj.edu.pl
;
K. Byrski
krzysztof.byrski@uj.edu.pl
关键词:
Clustering
;
Gaussian mixture models
;
Expectation maximization
;
Cross-Entropy
Clustering
;
Active curve axis gaussian mixture model
刊名:Expert Systems with Applications
出版年:2017
10.
General split gaussian Cross-Entropy
clustering
作者:
Przemysław Spurek
1
;
przemyslaw.spurek@ii.uj.edu.pl" class="auth_mail" title="E-mail the corresponding author
关键词:
Clustering
;
Split gaussian
;
Expectation maximization
;
Gaussian mixture model
;
Cross&ndash
;
Entropy
clustering
刊名:Expert Systems with Applications
出版年:2017
1
2
3
4
5
6
7
8
9
按检索点细分(21803)
题名(5530)
关键词(7090)
文摘(18762)
NGLC 2004-2010.National Geological Library of China All Rights Reserved.
Add:29 Xueyuan Rd,Haidian District,Beijing,PRC. Mail Add: 8324 mailbox 100083
For exchange or info please contact us via
email
.