Ming-Syan Chen

Learn More
In this paper, we examine the issue of mining association rules among items in a large database of sales transactions. The mining of association rules can be mapped into the problem of discovering large itemsets where a large itemset is a group of items which appear in a sufficient number of transactions. The problem of discovering large itemsets can be(More)
In this paper, we explore a new data mining capability that involves mining path traversal patterns in a distributed information-providing environment where documents or objects are linked together to facilitate interactive access. Our solution procedure consists of two steps. First, we derive an algorithm to convert the original sequence of log data into a(More)
In this paper, we examine the issue of mining association rules among items in a large database of sales transactions. The mining of association rules can be mapped into the problem of discovering large itemsets where a large itemset is a group of items which appear in a suucient number of transactions. The problem of discovering large itemsets can be(More)
The processor allocation problem in an n-dimenallocating processors in MIMD hypercubes is the subject of sional hypercube (or an n-cube) multiprocessor is similar to the this paper. conventional memory allocation problem. The main objective in A task arriving at a hypercube multiprocessor-this is called both problems is to maximize the utilization of(More)
We present <i>PROUD</i> -- A PRObabilistic approach to processing similarity queries over Uncertain Data streams, where the data streams here are mainly time series streams. In contrast to data with certainty, an uncertain series is an ordered sequence of random variables. The distance between two uncertain series is also a random variable. We use a general(More)
This paper presents a new formulation of DASD (direct access storage device) disk arm scheduling schemes for multimedia storage management. The formulation, referred to as grouped sweeping scheduling (GSS), provides a framework for minimizing the buffer space required in the retrieval of multimedia streams. In GSS, the set ofn media streams that are to be(More)
In this paper, we explore a new data mining capability which involves mining path traversal patterns in a distributed information providing environment like worldwide web. First, we convert the original sequence of log data into a set of maximal forward references and lter out the eeect of some backward references which are mainly made for ease of(More)
Recent technology advances in mobile networking have ushered in a new era of personal communication. Users can ubiquitously access the Internet via many emerging mobile appliances, such as portable notebooks, personal digital assistants (PDAs), and WAP-enabled cellular phones. While the transcoding proxy is attracting an increasing amount of attention in(More)