Citation Context

...ta mining task with broad applications. In the last decade, there are many in-depth studies on frequent pattern mining, which can be grouped into two categories. The first category of studies (e.g., (=-=Agrawal & Srikant, 1994-=-; Han et al., 2000; Zaki et al., 1997a; Agarwal et al., 2001)) focus on developing efficient algorithms for frequent pattern mining. With the exciting progress, mining frequent patterns from large dat...

Citation Context

...attern-based frequent pattern mining to preference-based data mining in principle and draw a general framework. Keywords: Data mining, Frequent-pattern mining1. INTRODUCTION Frequent pattern mining (=-=Agrawal et al., 1993-=-) is an important data mining task with broad applications. In the last decade, there are many in-depth studies on frequent pattern mining, which can be grouped into two categories. The first category...

Citation Context

... applications. In the last decade, there are many in-depth studies on frequent pattern mining, which can be grouped into two categories. The first category of studies (e.g., (Agrawal & Srikant, 1994; =-=Han et al., 2000-=-; Zaki et al., 1997a; Agarwal et al., 2001)) focus on developing efficient algorithms for frequent pattern mining. With the exciting progress, mining frequent patterns from large databases becomes hig...

Citation Context

...the last decade, there are many in-depth studies on frequent pattern mining, which can be grouped into two categories. The first category of studies (e.g., (Agrawal & Srikant, 1994; Han et al., 2000; =-=Zaki et al., 1997-=-a; Agarwal et al., 2001)) focus on developing efficient algorithms for frequent pattern mining. With the exciting progress, mining frequent patterns from large databases becomes highly feasible, thoug...

Citation Context

...again and again is usually time consuming. � Example 2 (Motivating example 2) Consider mining frequent patterns for classification. Several recent studies (e.g., (Liu et al., 1998; Wang et al., 2000; =-=Dong & Li, 1999-=-; Li et l.,2001)) have shown that classification based on frequent patterns, such as associative classification and classification by emerging patterns, can achieve high accuracy and good understand-a...

Citation Context

...ases, frequent pattern mining may return such a huge number of frequent patterns that a user cannot handle. To tackle this problem, the constraint-based frequent pattern mining framework is proposed (=-=Ng et al., 1998-=-). Various constraints can be raised and only the frequent patterns satisfying the constraints should be mined. Efficient algorithms have been developed to push different kinds of constraints deep int...

Citation Context

...re are many in-depth studies on frequent pattern mining, which can be grouped into two categories. The first category of studies (e.g., (Agrawal & Srikant, 1994; Han et al., 2000; Zaki et al., 1997a; =-=Agarwal et al., 2001-=-)) focus on developing efficient algorithms for frequent pattern mining. With the exciting progress, mining frequent patterns from large databases becomes highly feasible, though the development of fa...

Citation Context

...onal properties. Methods have been developed to push various constraints deep into the mining. Some special cases of preference-based frequent pattern mining have been studied recently. For example, (=-=Bayardo & Agrawal, 1999-=-) proposes mining the most interesting rules. (Fu et al., 2000) studies mining the top-k frequent itemsets. In (Han et al., 2002), an efficient algorithm for mining the top-k frequent closed itemsets ...

Citation Context

... algorithms is still demanding to catch up with the speed of data accumulation. On the other hand, it has been well recognized that the effectiveness of frequent pattern mining is a critical concern (=-=Zheng et al., 2001-=-). In many cases, frequent pattern mining may return such a huge number of frequent patterns that a user cannot handle. To tackle this problem, the constraint-based frequent pattern mining framework i...

Citation Context

...the constraints should be mined. Efficient algorithms have been developed to push different kinds of constraints deep into the mining (e.g., (Ng et al., 1998;Lakshmanan et al., 1999; Pei & Han, 2000; =-=Pei et al., 2001-=-; Kifer et al., 2003)). With the current frequent pattern mining algorithms and constraint pushing techniques, is frequent pattern mining effective and efficacious enough? Example 1 (Motivating exampl...

Citation Context

...ses, including (Govindarajan et al., 1995; K. Govindarajan and B. Jayaraman and S. Mantha, 2001; Kostler et al., 1995). The formal languages of preference relations are developed in (Kiessling, 2002; =-=Kiessling & Kostler, 2002-=-; Chomicki, 2002). The idea of specifying preferece-based mining queries in this paper is similar to those in the above studies. The problem of frequent pattern mining is firstly identified by Agrawal...

Citation Context

...terns satisfying the constraints should be mined. Efficient algorithms have been developed to push different kinds of constraints deep into the mining (e.g., (Ng et al., 1998;Lakshmanan et al., 1999; =-=Pei & Han, 2000-=-; Pei et al., 2001; Kifer et al., 2003)). With the current frequent pattern mining algorithms and constraint pushing techniques, is frequent pattern mining effective and efficacious enough? Example 1 ...

Citation Context

...n et al., 1995; K. Govindarajan and B. Jayaraman and S. Mantha, 2001; Kostler et al., 1995). The formal languages of preference relations are developed in (Kiessling, 2002; Kiessling & Kostler, 2002; =-=Chomicki, 2002-=-). The idea of specifying preferece-based mining queries in this paper is similar to those in the above studies. The problem of frequent pattern mining is firstly identified by Agrawal et al. as a key...

Citation Context

...n mining is related to two categories of previous studies: preference queries and frequent pattern mining techniques. The problem of preference queries is firstly addressed by Lacroix and Lavency in (=-=Lacroix & Lavency, 1987-=-). They formulate preferences as a series of conditions for selection.The nonempty set of answer satisfying the longest sub-series of conditions should be returned. The compositions of preferences ar...

Citation Context

...and only the frequent patterns satisfying the constraints should be mined. Efficient algorithms have been developed to push different kinds of constraints deep into the mining (e.g., (Ng et al., 1998;=-=Lakshmanan et al., 1999-=-; Pei & Han, 2000; Pei et al., 2001; Kifer et al., 2003)). With the current frequent pattern mining algorithms and constraint pushing techniques, is frequent pattern mining effective and efficacious e...

Citation Context

...requent pattern mining have been studied recently. For example, (Bayardo & Agrawal, 1999) proposes mining the most interesting rules. (Fu et al., 2000) studies mining the top-k frequent itemsets. In (=-=Han et al., 2002-=-), an efficient algorithm for mining the top-k frequent closed itemsets is proposed. To the best of our knowledge, this paper is the first study systematically tackling the problem of preference-based...

Citation Context

...the constraints should be mined. Efficient algorithms have been developed to push different kinds of constraints deep into the mining (e.g., (Ng et al., 1998;Lakshmanan et al., 1999; Pei & Han, 2000; =-=Pei et al., 2001-=-; Kifer et al., 2003)). With the current frequent pattern mining algorithms and constraint pushing techniques, is frequent pattern mining effective and efficacious enough? Example 1 (Motivating exampl...

Citation Context

...the last decade, there are many in-depth studies on frequent pattern mining, which can be grouped into two categories. The first category of studies (e.g., (Agrawal & Srikant, 1994; Han et al., 2000; =-=Zaki et al., 1997-=-a; Agarwal et al., 2001)) focus on developing efficient algorithms for frequent pattern mining. With the exciting progress, mining frequent patterns from large databases becomes highly feasible, thoug...

Citation Context

... mining algorithms again and again is usually time consuming. � Example 2 (Motivating example 2) Consider mining frequent patterns for classification. Several recent studies (e.g., (Liu et al., 1998; =-=Wang et al., 2000-=-; Dong & Li, 1999; Li et l.,2001)) have shown that classification based on frequent patterns, such as associative classification and classification by emerging patterns, can achieve high accuracy and ...

Citation Context

...b-series of conditions should be returned. The compositions of preferences are not considered. Several logical approaches to preferences are proposed in the context of deductive databases, including (=-=Govindarajan et al., 1995-=-; K. Govindarajan and B. Jayaraman and S. Mantha, 2001; Kostler et al., 1995). The formal languages of preference relations are developed in (Kiessling, 2002; Kiessling & Kostler, 2002; Chomicki, 2002...

Citation Context

...t considered. Several logical approaches to preferences are proposed in the context of deductive databases, including (Govindarajan et al., 1995; K. Govindarajan and B. Jayaraman and S. Mantha, 2001; =-=Kostler et al., 1995-=-). The formal languages of preference relations are developed in (Kiessling, 2002; Kiessling & Kostler, 2002; Chomicki, 2002). The idea of specifying preferece-based mining queries in this paper is si...

Citation Context

... deductive databases, including (Govindarajan et al., 1995; K. Govindarajan and B. Jayaraman and S. Mantha, 2001; Kostler et al., 1995). The formal languages of preference relations are developed in (=-=Kiessling, 2002-=-; Kiessling & Kostler, 2002; Chomicki, 2002). The idea of specifying preferece-based mining queries in this paper is similar to those in the above studies. The problem of frequent pattern mining is fi...

Citation Context

...ts deep into the mining. Some special cases of preference-based frequent pattern mining have been studied recently. For example, (Bayardo & Agrawal, 1999) proposes mining the most interesting rules. (=-=Fu et al., 2000-=-) studies mining the top-k frequent itemsets. In (Han et al., 2002), an efficient algorithm for mining the top-k frequent closed itemsets is proposed. To the best of our knowledge, this paper is the f...

Citation Context

...ould be mined. Efficient algorithms have been developed to push different kinds of constraints deep into the mining (e.g., (Ng et al., 1998;Lakshmanan et al., 1999; Pei & Han, 2000; Pei et al., 2001; =-=Kifer et al., 2003-=-)). With the current frequent pattern mining algorithms and constraint pushing techniques, is frequent pattern mining effective and efficacious enough? Example 1 (Motivating example 1) Suppose a manag...