Introduction to algorithms
Robust and efficient fuzzy match for online data cleaning
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Semi-supervised learning using randomized mincuts
ICML '04 Proceedings of the twenty-first international conference on Machine learning
Efficient exact set-similarity joins
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Benchmarking declarative approximate selection predicates
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Semi-supervised polarity lexicon induction
EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics
Word to sentence level emotion tagging for Bengali blogs
ACLShort '09 Proceedings of the ACL-IJCNLP 2009 Conference Short Papers
Sentence level sentiment analysis in the presence of conjuncts using linguistic analysis
ECIR'07 Proceedings of the 29th European conference on IR research
Disambiguating dynamic sentiment ambiguous adjectives
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics
Enhanced sentiment learning using Twitter hashtags and smileys
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics: Posters
Chinese sentence-level sentiment classification based on fuzzy sets
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics: Posters
Domain customization for aspect-oriented opinion analysis with multi-level latent sentiment clues
Proceedings of the 20th ACM international conference on Information and knowledge management
Semi-supervised recursive autoencoders for predicting sentiment distributions
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Hi-index | 0.00 |
A set-similarity joins based semi-supervised approach is presented to mine Chinese sentiment words and sentences. The set-similarity joins is taken to join nodes in unconnected sub-graphs conducted by cutting the flow graph with Ford-Fulkerson algorithm into positive and negative sets to correct wrong polarities predicted by min-cut based semi-supervised methods. Experimental results in digital, entertainment, and finance domains demonstrate the effectiveness of our proposed approach.