33348508
Knowledge Discovery in Multiple Databases
14606443
Database classification for multi-database mining
Many large organizations have multiple databases distributed in different branches, and therefore multidatabase mining is an important task for data mining. To reduce the search cost in the data from all databases, we need to identify which databases are most likely relevant to a data mining application. This is referred to as database selection. For real-world applications, database selection has to be carried out multiple times to identify relevant databases that meet different applications. In particular, a mining task may be without reference to any specific application. In this paper, we present an efficient approach for classifying multiple databases based on their similarity between each other. Our approach is application-independent.
14353526
A logical framework for identifying quality knowledge from different data sources
As the Web has emerged as a large distributed data repository, individuals and organizations have been able to utilize the low-cost information and knowledge on the Internet when making business decisions. Because data in different data sources may be conflictive or untrue, researchers and practitioners must intensify efforts to develop appropriate techniques for its efficient use and management. In this paper, a logical framework is designed for identifying quality knowledge from different data sources, thus working towards the development of an agreed ontology. Our experimental results have demonstrated that the approach is promising, and that a minor data enhancement adjustment could bring higher effectiveness.
39603817
Optimal Terrain Construction Problems and Applications in Intensity-Modulated Radiation Therapy
In this paper, we study several rectilinear terrain construction problems, which model leaf sequencing problems in intensity-modulated radiation therapy (IMRT). We present a novel unified approach based on geometric techniques for solving these terrain construction problems. Our approach leads to the first algorithms for several leaf sequencing problems in IMRT that are practically fast and guarantee the optimal quality of the output solutions. Our implementation results show that our terrain construction algorithms run very fast on real medical data.
7000665
Multiple Agents Moving Target Search
Traditional single-agent search algorithms usually make simplifying assumptions (single search agent, stationary target, complete knowledge of the state, and sufficient time). There are algorithms for relaxing one or two of these constraints; in this paper we want to relax all four. The application domain is to have multiple search agents cooperate to pursue and capture a moving target. Agents are allowed to communicate with each other. For solving Multiple Agents Moving Target (MAMT) applications, we present a framework for specifying a family of suitable search algorithms. This paper investigates several effective approaches for solving problem instances in this domain.
206750828
Directly operable image representation of multiscale primal sketch
In this paper, we propose a versatile semantics-driven image representation that can support many common operations in visual computing and communications, in addition to being itself an efficient image coding scheme. The proposed image representation is based on a semantically meaningful construct called multiscale primal sketch (MPS). The MPS consists of edges that are extracted and organized successively from fine to coarse scales. The edges are further classified into two types: pulse edge and step edge. MPS is an intermediate-level image representation, which is between pixel-based (low-level) and object-based (high-level) descriptions. The MPS image representation reaches a good compromise between its construction cost and descriptive power. It has a compact form, and hence is amenable to image compression. Furthermore, because the new representation consists of semantically meaningful primitives - edges of different scales and types, and background - many common image operations, such as classification, restoration, detection, and content-based retrieval, can be performed directly in the MPS framework, without first converting the coded image back to the spatial domain.
36354030
Globally optimal uneven error-protected packetization of scalable code streams
In this paper, we present a family of new algorithms for rate-fidelity optimal packetization of scalable source bit streams with uneven error protection. In the most general setting where no assumption is made on the probability function of packet loss or on the rate-fidelity function of the scalable code stream, one of our algorithms can find the globally optimal solution to the problem in O(N/sup 2/L/sup 2/) time, compared to a previously obtained O(N/sup 3/L/sup 2/) complexity, where N is the number of packets and L is the packet payload size. If the rate-fidelity function of the input is convex, the time complexity can be reduced to O(NL/sup 2/) for a class of erasure channels, including channels for which the probability function of losing n packets is monotonically decreasing in n and independent erasure channels with packet erasure rate no larger than N/2(N + 1). Furthermore, our O(NL/sup 2/) algorithm for the convex case can be modified to rind an approximation solution for the general case. All of our algorithms do away with the expediency of fractional bit allocation, a limitation of some existing algorithms.
12525108
The Layered Net Surface Problems in Discrete Geometry and Medical Image Segmentation
Efficient detection of multiple inter-related surfaces representing the boundaries of objects of interest in d-D images (d >/= 3) is important and remains challenging in many medical image analysis applications. In this paper, we study several layered net surface (LNS) problems captured by an interesting type of geometric graphs called ordered multi-column graphs in the d-D discrete space (d >/= 3 is any constant integer). The LNS problems model the simultaneous detection of multiple mutually related surfaces in three or higher dimensional medical images. Although we prove that the d-D LNS problem (d >/= 3) on a general ordered multi-column graph is NP-hard, the (special) ordered multi-column graphs that model medical image segmentation have the self-closure structures and thus admit polynomial time exact algorithms for solving the LNS problems. Our techniques also solve the related net surface volume (NSV) problems of computing well-shaped geometric regions of an optimal total volume in a d-D weighted voxel grid. The NSV problems find applications in medical image segmentation and data mining. Our techniques yield the first polynomial time exact algorithms for several high dimensional medical image segmentation problems. Experiments and comparisons based on real medical data showed that our LNS algorithms and software are computationally efficient and produce highly accurate and consistent segmentation results.