Filtering the Unwanted Messages from Online Social Networks Using Machine Learning Techniques
Abstract
Keywords
Full Text:
PDFReferences
Adomavicius and G. Tuzhilin, “Toward the Next Generation of Recommender Systems: A Survey of the State-f-the-Art and Possible Extensions,” IEEE Trans. Knowledge and Data Eng., vol. 17,no. 6, pp. 734-749, June 2005.
R.J. Mooney and L. Roy, “Content-Based Book Recommending Using Learning for Text Categorization,” Proc. Fifth ACM Conf. Digital Libraries, pp. 195-204, 2000.
.F. Sebastiani, “Machine Learning in Automated Text Categorization,” ACM Computing Surveys, vol. 34, no. 1, pp. 1-47, 2002.
G. Amati and F. Crestani, “Probabilistic Learning for Selective Dissemination of Information,” Information Processing and Management, vol. 35, no. 5, pp. 633-654, 1999.
M.J. Pazzani and D. Billsus, “Learning and Revising User Profiles: The Identification of Interesting Web Sites,” Machine Learning, vol. 27, no.3, pp. 313-331, 1997.
Y. Zhang and J. Callan, “Maximum Likelihood Estimation for Filtering Thresholds,” Proc. 24th Ann. Int’l ACM SIGIR Conf.Research and Development in Information Retrieval, pp. 294-302, 2001.
C. Apte, F. Damerau, S.M. Weiss, D. Sholom, and M. Weiss, “Automated Learning of Decision Rules for Text Categorization,”Trans. Information Systems, vol. 12, no. 3, pp. 233-251, 1994.
S. Dumais, J. Platt, D. Heckerman, and M. Sahami, “Inductive Learning Algorithms and Representations for Text Categorization,” Proc. Seventh Int’l Conf. Information and Knowledge Management (CIKM ’98), pp. 148-155, 1998.
D.D. Lewis, “An Evaluation of Phrasal and Clustered Representations on a Text CategorizationTask,” Proc. 15th ACM Int’l Conf.Research and Development in Information Retrieval (SIGIR ’92), N.J. Belkin, P. Ingwersen, and A.M. Pejtersen, eds., pp. 37-50, 1992.
R.E. Schapire and Y. Singer, “Boostexter: A Boosting-Based System for Text Categorization,” Machine Learning, vol. 39, nos. 2/3, pp. 135-168, 2000.
H. Schu¨ tze, D.A. Hull, and J.O. Pedersen, “A Comparison of Classifiers and Document Representations for the Routing Problem,” Proc. 18th Ann. ACM/SIGIR Conf. Research and Development in Information Retrieval , pp. 229-237, 1995.
E.D. Wiener, J.O. Pedersen, and A.S. Weigend, “A Neural Network Approach to Topic Spotting,” Proc. Fourth Ann. Symp. Document Analysis and Information Retrieval (SDAIR ’95), pp. 317-332, 1995.
T. Joachims, “Text Categorization with Support Vector Machines: Learning with Many Relevant Features,” Proc. European Conf.Machine Learning, pp. 137-142, 1998.
T. Joachims, “A Probabilistic Analysis of the Rocchio Algorithm with TFIDF for Text Categorization,” Proc. Int’l Conf. Machine Learning, pp. 143-151, 1997.
S.E. Robertson and K.S. Jones, “Relevance Weighting of Search Terms,” J. Am. Soc. For Information Science, vol. 27, no. 3, pp. 129- 146, 1976.
S. Zelikovitz and H. Hirsh, “Improving Short TextClassification Using Unlabeled Background Knowledge,” Proc. 17th Int’l Conf. Machine Learning (ICML ’00), P. Langley, ed., pp. 1183-1190, 2000.
J. Moody and C. Darken, “Fast Learning in Networks of Locally-Tuned Processing Units,” Neural Computation, vol. 1, no. 2,pp. 281-294, 1989.
E.J. Hartman, J.D. Keeler, and J.M. Kowalski, “Layered Neural Networks with Gaussian Hidden Units as Universal Approximations,” Neural Computation, vol. 2, pp. 210-215, 1990.
J. Park and I.W. Sandberg, “Approximation and Radial-Basis-Function Networks,” Neural Computation, vol. 5, pp. 305-316, 1993.
A.K. Jain, R.P.W. Duin, and J. Mao, “Statistical Pattern Recognition: A Review,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 22, no. 1, pp. 4-37, Jan. 2000.
Refbacks
- There are currently no refbacks.