A Rough Set Approach to Classifying Web Page Without Negative Examples
暂无分享,去创建一个
Duoqian Miao | Qiguo Duan | Kaimin Jin | D. Miao | Qiguo Duan | Kaimin Jin
[1] David D. Lewis,et al. A comparison of two learning algorithms for text categorization , 1994 .
[2] Philip S. Yu. Editorial: State of the Transactions , 2004, IEEE Trans. Knowl. Data Eng..
[3] Andrzej Skowron,et al. Tolerance Approximation Spaces , 1996, Fundam. Informaticae.
[4] Jiawei Han,et al. PEBL: Web page classification without negative examples , 2004, IEEE Transactions on Knowledge and Data Engineering.
[5] Malik Yousef,et al. One-Class SVMs for Document Classification , 2002, J. Mach. Learn. Res..
[6] Janusz Zalewski,et al. Rough sets: Theoretical aspects of reasoning about data , 1996 .
[7] Philip S. Yu,et al. Partially Supervised Classification of Text Documents , 2002, ICML.
[8] Hung Son Nguyen,et al. A Tolerance Rough Set Approach to Clustering Web Search Results , 2004, PKDD.
[9] Dino Pedreschi,et al. Knowledge Discovery in Databases: PKDD 2004 , 2004, Lecture Notes in Computer Science.
[10] Marzena Kryszkiewicz,et al. Rough Set Approach to Incomplete Information Systems , 1998, Inf. Sci..
[11] Tu Bao Ho,et al. Nonhierarchical document clustering based on a tolerance rough set model , 2002, Int. J. Intell. Syst..