Collective classification can significantly improve accuracy by exploiting relationships among instances. Although several collective inference procedures have been reported, they have not been thoroughly evaluated for their commonalities and differences. We introduce novel generalizations of three existing algorithms that allow such algorithmic and empirical comparisons. Our generalizations permit us to examine how cautiously or aggressively each algorithm exploits intermediate relational data, which can be noisy. We conjecture that cautious approaches that identify and preferentially exploit the more reliable intermediate data should outperform aggressive approaches. We explain why caution is useful and introduce three parameters to control the degree of caution. An empirical evaluation of collective classification algorithms, using two base classifiers on three data sets, supports our conjecture.

No abstract

No abstract

No abstract

To enhance and improve the interoperability of meteorological Web Services, we are currently developing an Integrated Web Services Brokering System (IWB). IWB uses a case-based classifier to automatically discover Web Services. In this paper, we explore the use of rough set techniques for selecting features prior to classification. We demonstrate the effectiveness of this feature technique by comparing it with a leading non-rough set (Information Gain) feature selection technique.