Feature Selection in Learning Common Sense Associations Using Matrix Factorization

Feature Selection in Learning Common Sense Associations Using Matrix Factorization We propose a computational model to learn the common sense association between a pair of concept classes based on a bipartite network and matrix factorization methods. We view the concept-pair association as a bipartite network so that the autoassociation mappings can become similarity constraints. We impose the additional similarity and regularity constraints on the optimization objectives so that a mapping matrix can be found in the matrix factorization to best fit the observation data. We extract 139 locations and 436 activities and 667 location–activity pairs from ConceptNet ( http://conceptnet5.media.mit.edu/ ). We evaluate the performance in terms of F-factor, precision, and recall using a common sense association problem between locations and activities against four feature selection strategies in the matrix factorization optimization. The comparison between the performances with and without human judgment reveals that matrix factorization method tends to show good generalization even under very little observation evidence. Among the four feature selection methods, the maximal entropy method performs better in terms of F-score and recall when the feature number is more than 30 % while SVD method performs better in terms of F-score and recall when the feature number is less than 30 %. Random selection can have a higher precision given “enough” features, but it tends to be the worst performer in the recall and F-score. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Fuzzy Systems Springer Journals

Feature Selection in Learning Common Sense Associations Using Matrix Factorization

Loading next page...
 
/lp/springer_journal/feature-selection-in-learning-common-sense-associations-using-matrix-t0SALrgRK5
Publisher
Springer Berlin Heidelberg
Copyright
Copyright © 2016 by Taiwan Fuzzy Systems Association and Springer-Verlag Berlin Heidelberg
Subject
Engineering; Computational Intelligence; Artificial Intelligence (incl. Robotics); Operations Research, Management Science
ISSN
1562-2479
eISSN
2199-3211
D.O.I.
10.1007/s40815-016-0235-4
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