Novel BCC Method to Improve the Classification Performance in Sparsely Labeled Networks

Authors

  • A. Anusha Nagalakshmi  PG Scholar, Department of MCA, St .Anns College of Engineering & Technology, Chirala, Andhra Pradesh, India
  • Dr. R. Murugadoss  Professor, Department of MCA, St .Ann’s College of Engineering & Technology, Chirala, Andhra Pradesh, India

Keywords:

Text Classification, Speech Acts, Email Management, Machine Learning, Collective Classification.

Abstract

Consider order of email messages with respect to regardless of whether they contain certain “email acts”, for example, a demand or a dedication. Demonstrate that abusing the successive relationship among email messages in a similar string can enhance email-act grouping. All the more particularly, portray another content order algorithm in light of a reliance organize based aggregate arrangement technique, in which the local classifiers are most extreme entropy models in view of words and certain social highlights. In this demonstrate that factually critical upgrades over a pack of-words pattern classifier can be acquired for a few, however not all, email-act classes. Performance changes acquired by aggregate arrangement seem, by all accounts, to be predictable crosswise over many email acts proposed by earlier speech act hypothesis.

References

  1. Jensen, J. Neville and B. Gallagher. Why Collective Classification Inference Improves Relational Classification. Proceedings of the 10th ACM SIGKDD, 2004.
  2. E. Kraut, S.R. Fussell, F.J. Lerch,and A. Espinosa. A. Coordination in Teams: Evidence from a Simulated Management Game. To appear in the Journal of Organizational Behavior.
  3. Leusky. Email is a Stage: Discovering People Roles from Email Archives. ACM SIGIR, 2004.
  4. Murakoshi, A. Shimazu, and K. Ochimizu. Construction of Deliberation Structure in Email Communication. Pacific Association for Computational Linguistics, 1999.
  5. Neville and D. Jensen. Iterative Classification in Relational Data. AAAI-2000 Workshop on Learning Statistical Models from Relational Data. AAAI Press, 2000.
  6. Neville, D. Jensen, and J. Rattigan. Statistical Relational Learning: Four Claims and a Survey. Workshop on Learning Statistical Models from Relational Data, 18th IJCAI, 2003.
  7. Sha and F. Pereira. Shallow Parsing with Conditional Random Fields. Proceedings of the HLT-NAACL, ACM, 2003.
  8. Carletta. Assessing Agreement on Classification Tasks: The Kappa Statistic. Computational Linguistics, 22(2):249-254, 1996.
  9. R. Carvalho, W. Wu, W.W. Cohen and J. Kleinberg. Predicting Leadership Roles in Email Workgroups. Work in Progress, http://www.cs.cmu.edu/˜vitor/publications.html.
  10. W. Cohen, V.R. Carvalho and T.M. Mitchell. Learning to Classify Email into “Speech Acts”. Proceedings of the EMNLP, Barcelona, Spain, July 2004.
  11. W. Cohen. Minorthird: Methods for Identifying Names and Ontological Relations in Text using Heuristics for Inducing Regularities from Data. In http://minorthird.sourceforge.net, 2004.
  12. Chakrabarti and P. Indyk. Enhanced Hypertext Categorization Using Hypelinks. Proceedings of the ACM SIGMOD, Seattle , Washington, 1998.
  13. Geman and D. Geman. Stochastic Relaxation, Gibbs Distributions and the Bayesian Restoration of Images. IEEE Transactions on Pattern Analysis and MachineIntelligence, (6):721-741, 1984.
  14. Heckerman, D. Chickering, C. Meek, R. Rounthwaite, and C. Kadie. Dependency networks for inference, collaborative filtering and data visualization. Journal of Machine Learning Research, (1):49-75, 2000.

Downloads

Published

2018-02-28

Issue

Section

Research Articles

How to Cite

[1]
A. Anusha Nagalakshmi, Dr. R. Murugadoss, " Novel BCC Method to Improve the Classification Performance in Sparsely Labeled Networks, IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology(IJSRCSEIT), ISSN : 2456-3307, Volume 3, Issue 1, pp.1185-1192, January-February-2018.