Incremental enhanced α-expansion move for large data: a probability regularization perspective

Incremental enhanced α-expansion move for large data: a probability regularization perspective To deal with large data clustering tasks, an incremental version of exemplar-based clustering algorithm is proposed in this paper. The novel clustering algorithm, called Incremental Enhanced α-Expansion Move (IEEM), processes large data chunk by chunk. The work here includes two aspects. First, in terms of the maximum a posteriori principle, a unified target function is developed to unify two typical exemplar-based clustering algorithms, namely Affinity Propagation (AP) and Enhanced α-Expansion Move (EEM). Secondly, with the proposed target function, the probability based regularization term is proposed and accordingly the proposed target function is extended to make IEEM have the ability to improve clustering performance of the entire dataset by leveraging the clustering result of previous chunks. Another outstanding characteristic of IEEM is that only by modifying the definitions of several variables used in EEM, the minimization procedure of EEM and its theoretical spirit can be easily kept in IEEM, and hence no more efforts are needed to develop a new optimization algorithm for IEEM. In contrast to AP, EEM and the existing incremental clustering algorithm IMMFC, our experimental results of synthetic and real-world datasets indicate the effectiveness of IEEM. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Machine Learning and Cybernetics Springer Journals

Incremental enhanced α-expansion move for large data: a probability regularization perspective

Loading next page...
 
/lp/springer_journal/incremental-enhanced-expansion-move-for-large-data-a-probability-jXbjZFaTWj
Publisher
Springer Berlin Heidelberg
Copyright
Copyright © 2016 by Springer-Verlag Berlin Heidelberg
Subject
Engineering; Computational Intelligence; Artificial Intelligence (incl. Robotics); Control, Robotics, Mechatronics; Complex Systems; Systems Biology; Pattern Recognition
ISSN
1868-8071
eISSN
1868-808X
D.O.I.
10.1007/s13042-016-0532-0
Publisher site
See Article on Publisher Site

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 12 million articles from more than
10,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Unlimited reading

Read as many articles as you need. Full articles with original layout, charts and figures. Read online, from anywhere.

Stay up to date

Keep up with your field with Personalized Recommendations and Follow Journals to get automatic updates.

Organize your research

It’s easy to organize your research with our built-in tools.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

Monthly Plan

  • Read unlimited articles
  • Personalized recommendations
  • No expiration
  • Print 20 pages per month
  • 20% off on PDF purchases
  • Organize your research
  • Get updates on your journals and topic searches

$49/month

Start Free Trial

14-day Free Trial

Best Deal — 39% off

Annual Plan

  • All the features of the Professional Plan, but for 39% off!
  • Billed annually
  • No expiration
  • For the normal price of 10 articles elsewhere, you get one full year of unlimited access to articles.

$588

$360/year

billed annually
Start Free Trial

14-day Free Trial