The growing popularity of online product review forums invites people to express opinions and purchase their products. In variety of different item set, it is very difficult to analysis skyline product from the set of different product. A consumer electronics world, product should consisting of varieties in color, functionality, applicability, reasonability, there look and all. It is unpredictable to select a product from pool of given product. In multi-criteria decision making application, most previous studies focus on how to help customers find a set of best possible , profitable products from a pool of given products. In this paper, we identify an interesting problem, using dynamic constraint find top k product, which has not been studied before. Given a set of products in the existing market, we want to find a set of "best" possible products such that these new products are not dominated by the products in the existing market. A straightforward solution is to enumerate all possible subsets of size k and find the subset which gives the greatest profit. However, there are an exponential number of possible subsets. In this paper, we propose solutions to find the top-k products efficiently by considering. An extensive performance study using both synthetic and real datasets is reported to verify its effectiveness and efficiency.

Text mining.