![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Knowledge Based Systems, Volume 65
Volume 65, July 2014
- Ming-Wen Shao, Yee Leung:
Relations between granular reduct and dominance reduct in formal contexts. 1-11 - Yujian Li, Qiangkui Leng, Yaozong Fu, Houjun Li:
Growing construction of conlitron and multiconlitron. 12-20 - Peng-Cheng Zou, Jiandong Wang, Songcan Chen, Haiyan Chen:
Bagging-like metric learning for support vector regression. 21-30 - Jim Jing-Yan Wang, Yijun Sun:
From one graph to many: Ensemble transduction for content-based database retrieval. 31-37 - Wei-Kang Wang, Wen-Min Lu
, Qian Long Kweh
, I-Ting Cheng:
Does intellectual capital matter? Assessing the performance of CPA firms based on additive efficiency decomposition DEA. 38-49 - Shijun Zhai, Ting Jiang:
A novel particle swarm optimization trained support vector machine for automatic sense-through-foliage target recognition system. 50-59 - Min Li, Shaobo Deng, Lei Wang, Shengzhong Feng, Jianping Fan:
Hierarchical clustering algorithm for categorical data using a probabilistic rough set model. 60-71 - Hong Zhao, William Zhu
:
Optimal cost-sensitive granularization based on rough sets for variable costs. 72-82 - Zhe Wang, Changming Zhu, Zengxin Niu, Daqi Gao, Xiang Feng:
Multi-kernel classification machine with reduced complexity. 83-95 - Fuzhi Zhang, Quanqiang Zhou
:
HHT-SVM: An online method for detecting profile injection attacks in collaborative recommender systems. 96-105
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.