Web: http://arxiv.org/abs/2112.10152

Sept. 22, 2022, 1:12 a.m. | Lianmeng Jiao, Feng Wang, Zhun-ga Liu, Quan Pan

cs.LG updates on arXiv.org arxiv.org

As a representative evidential clustering algorithm, evidential c-means (ECM)
provides a deeper insight into the data by allowing an object to belong not
only to a single class, but also to any subset of a collection of classes,
which generalizes the hard, fuzzy, possibilistic, and rough partitions.
However, compared with other partition-based algorithms, ECM must estimate
numerous additional parameters, and thus insufficient or contaminated data will
have a greater influence on its clustering performance. To solve this problem,
in this …

arxiv clustering transfer transfer learning

More from arxiv.org / cs.LG updates on arXiv.org

Postdoctoral Fellow: ML for autonomous materials discovery

@ Lawrence Berkeley National Lab | Berkeley, CA

Research Scientists

@ ODU Research Foundation | Norfolk, Virginia

Embedded Systems Engineer (Robotics)

@ Neo Cybernetica | Bedford, New Hampshire

2023 Luis J. Alvarez and Admiral Grace M. Hopper Postdoc Fellowship in Computing Sciences

@ Lawrence Berkeley National Lab | San Francisco, CA

Senior Manager Data Scientist

@ NAV | Remote, US

Senior AI Research Scientist

@ Earth Species Project | Remote anywhere

Research Fellow- Center for Security and Emerging Technology (Multiple Opportunities)

@ University of California Davis | Washington, DC

Staff Fellow - Data Scientist

@ U.S. FDA/Center for Devices and Radiological Health | Silver Spring, Maryland

Staff Fellow - Senior Data Engineer

@ U.S. FDA/Center for Devices and Radiological Health | Silver Spring, Maryland

Research Engineer - VFX, Neural Compositing

@ Flawless | Los Angeles, California, United States

[Job-TB] Senior Data Engineer

@ CI&T | Brazil

Data Analytics Engineer

@ The Fork | Paris, France