236 research outputs found

    Preference Mining Using Neighborhood Rough Set Model on Two Universes

    Get PDF
    Preference mining plays an important role in e-commerce and video websites for enhancing user satisfaction and loyalty. Some classical methods are not available for the cold-start problem when the user or the item is new. In this paper, we propose a new model, called parametric neighborhood rough set on two universes (NRSTU), to describe the user and item data structures. Furthermore, the neighborhood lower approximation operator is used for defining the preference rules. Then, we provide the means for recommending items to users by using these rules. Finally, we give an experimental example to show the details of NRSTU-based preference mining for cold-start problem. The parameters of the model are also discussed. The experimental results show that the proposed method presents an effective solution for preference mining. In particular, NRSTU improves the recommendation accuracy by about 19% compared to the traditional method

    A comparison of two types of rough sets induced by coverings

    Get PDF
    Rough set theory is an important technique in knowledge discovery in databases. In covering-based rough sets, many types of rough set models were established in recent years. In this paper, we compare the covering-based rough sets defined by Zhu with ones defined by Xu and Zhang. We further explore the properties and structures of these types of rough set models. We also consider the reduction of coverings. Finally, the axiomatic systems for the lower and upper approximations defined by Xu and Zhang are constructed

    Parametric Rough Sets with Application to Granular Association Rule Mining

    Get PDF
    Granular association rules reveal patterns hidden in many-to-many relationships which are common in relational databases. In recommender systems, these rules are appropriate for cold-start recommendation, where a customer or a product has just entered the system. An example of such rules might be “40% men like at least 30% kinds of alcohol; 45% customers are men and 6% products are alcohol.” Mining such rules is a challenging problem due to pattern explosion. In this paper, we build a new type of parametric rough sets on two universes and propose an efficient rule mining algorithm based on the new model. Specifically, the model is deliberately defined such that the parameter corresponds to one threshold of rules. The algorithm benefits from the lower approximation operator in the new model. Experiments on two real-world data sets show that the new algorithm is significantly faster than an existing algorithm, and the performance of recommender systems is stable

    Roughness in Anti Semigroup

    Full text link
    In this paper, we present the concepts of the upper and lower approximations of Anti-rough subgroups, Anti-rough subsemigroups, and homeomorphisms of Anti-Rough anti-semigroups in approximation spaces. Specify the concepts of rough in Finite anti-groups of types(4) are studies. Moreover, some properties of approximations and these algebraic structures are introduced. In addition, we give the definition of homomorphism anti-group
    corecore