Let G = (V, E) be a complete undirected graph with vertex set V, edge set E, and edge weights /(e) satisfying the triangle inequality. The vertex set V is partitioned into clusters V1, V2, …, Vk. The clustered traveling salesman problem (CTSP) seeks to ...

With the wide application of Web_2.0 and social software, there are more and more tag-related studies and applications. Because of the randomness and the personalization in users' tagging, tag research continues to encounter data space and semantics obstacles. With the min-max similarity (MMS) to es...

The ever-increasing complexity of industry facilities has made the reliability analysis and assessment an imperative yet tough work. Motivated by practical engineering requirement, this paper develops a Bayesian-based information extraction and aggregation (BIEA) approach for system level reliabilit...

Intuitively, not only do ratings include abundant information for learning user preferences, but also reviews accompanied by ratings. However, most existing recommender systems take rating scores for granted and discard the wealth of information in accompanying reviews. In this paper, in order to ex...

Mining from ambiguous data is very important in data mining. This paper discusses one of the tasks for mining from ambiguous data known as multi-instance problem. In multi-instance problem, each pattern is a labeled bag that consists of a number of unlabeled instances. A bag is negative if all insta...