7856172
Explanation Oriented Association Mining Using Rough Set Theory
This paper presents a new philosophical view and methodology for data mining. A framework of explanation oriented data mining is proposed and studied with respect to association mining. The notion of conditional associations is adopted, which explicitly expresses the conditions under which an association occurs. To illustrate the basic ideas, the theory of rough sets is used to construct explanations.
9438100
Classification Based on Logical Concept Analysis
This paper studies the problem of classification by using a concept lattice as a search space of classification rules. The left hand side of a classification rule is composed by a concept, including its extension and its intension, and the right hand side is the class label that the concept implies. Particularly, we show that logical concepts of the given universe are naturally associated with any consistent classification rules generated by any partition-based or covering-based algorithm, and can be characterized as a special set of consistent classification rules. An algorithm is proposed to find a set of the most general consistent concepts.
5309798
Conflict Analysis Based on Discernibility and Indiscernibility
The dual notions of discernibility and indiscernibility play an important role in intelligent data analysis. While discernibility focuses on the differences, the indiscernibility reveals the similarities. By considering them together in a same framework, one is able to obtain new insight of data. The main objective of the paper is to apply discernibility and indiscernibility to conflict analysis, a theory dealing with opinions of a set of agents on a set of issues. In particular, we are interested in the problem of issue reduction, so that a reduced set of issues can be obtained without loss of crucial information of the original set of issues. Extending the results from rough set theory, three types of issue reducts are introduced. They correspond to discernibility, indiscernibility, and discernibility-and-indiscernibility reducts, respectively. The results of this paper may offer a new research direction in rough set analysis in general, and conflict analysis in particular.
29045473
On Reduct Construction Algorithms
This paper critically analyzes reduct construction methods at two levels. At a high level, one can abstract commonalities from the existing algorithms, and classify them into three basic groups based on the underlying control structures. At a low level, by adopting different heuristics or fitness functions for attribute selection, one is able to derive most of the existing algorithms. The analysis brings new insights into the problem of reduct construction, and provides guidelines for the design of new algorithms
6912630
A Model of Machine Learning Based on User Preference of Attributes
A formal model of machine learning by considering user preference of attributes is proposed in this paper. The model seamlessly combines internal information and external information. This model can be extended to user preference of attribute sets. By using the user preference of attribute sets, user preferred reducts can be constructed.
27884919
Writing photo captions for the Web
Photographs are rarely self-sufficient. They need captions. A caption tells us something about the person or thing photographed, also something about the photographer. In this article, we discuss how to write photo captions for the Web. We provide examples from adultso and childrenos work.
10708118
Fault modeling and simulation for crosstalk in system-on-chip interconnects
System-on-chips (SOCs) using ultra deep sub-micron (DSM) technologies and GHz clock frequencies have been predicted by the 1997 SIA Road Map. Recent studies, as well as experiments reported in this paper, show significant crosstalk effects in long on-chip interconnects of GHz DSM chips. Recognizing the importance of high-speed, reliable interconnects in GHz SOCs, we address in this paper the problem of testing for glitch and delay errors caused by crosstalk in buses and interconnects between components of a SOC. Since it is not possible to explicitly test for all the possible process variations and defects that can lead to crosstalk errors in SOC interconnects, we present an abstract model, Maximum Aggressor (MA) fault model, and its test requirements. The attractiveness of the model is that it can abstract crosstalk defects in interconnects with a linear number of faults, while the corresponding MA tests provide complete coverage for all level defects related to cross-coupling capacitance the interconnects. A SPICE-level fault simulation methodology is presented which allows simulation of a small subset of the potentially exponential number of defects. The simulation methodology also enables validation of the proposed fault model and the resulting test set.
43233125
CRD: A New Data Mining Method in Deductive Databases
5956143
Fast Update Algorithm for IP Forwarding Table Using Independent Sets
This paper describes a new update algorithm for Internet Protocol (IP) forwarding tables. The update algorithm is so general that it can be combined with many IP address lookup algorithms for fast update. This is done by partitioning the IP forwarding table into independent sets. Each independent set can be looked as a set of disjoint ranges, therefore any data structure for disjoint ranges search can be combined with this algorithm to support fast update. This algorithm achieves fast update by avoiding the worst-case update scenario. The number of independent sets is small, hence, the number of parallel data structures is small.
8188664
Scalable On-Demand Streaming of Nonlinear Media
A conventional video file contains a single temporally-ordered sequence of video frames. Clients requesting on-demand streaming of such a file receive (all or intervals of) the same content. For popular files that receive many requests during a file playback time, scalable streaming protocols based on multicast or broadcast have been devised. Such protocols require server and network bandwidth that grow much slower than linearly with the file request rate. This paper considers ldquononlinearrdquo video content in which there are parallel sequences of frames. Clients dynamically select which branch of the video they wish to follow, sufficiently ahead of each branch point so as to allow the video to be delivered without jitter. An example might be ldquochoose-your-own-endingrdquo movies. With traditional scalable delivery architectures such as movie theaters or TV broadcasting, such personalization of the delivered video content is very difficult or impossible. It becomes feasible, in principle at least, when the video is streamed to individual clients over a network. For on-demand streaming of nonlinear media, this paper analyzes the minimal server bandwidth requirements, and proposes and evaluates practical scalable delivery protocols.