Please use this identifier to cite or link to this item:
|Title:||Finding interesting patterns using user expectations||Authors:||Liu, B.
|Issue Date:||1999||Citation:||Liu, B., Hsu, W., Mun, L.-F., Lee, H.-Y. (1999). Finding interesting patterns using user expectations. IEEE Transactions on Knowledge and Data Engineering 11 (6) : 817-832. ScholarBank@NUS Repository. https://doi.org/10.1109/69.824588||Abstract:||One of the major problems in the field of knowledge discovery (or data mining) is the interestingness problem. Past research and applications have found that, in practice, it is all too easy to discover a huge number of patterns in a database. Most of these patterns are actually useless or uninteresting to the user. But due to the huge number of patterns, it is difficult for the user to comprehend them and to identify those interesting to him/her. To prevent the user from being overwhelmed by the large number of patterns, techniques are needed to rank them according to their interestingness. In this paper, we propose such a technique, called the user-expectation method. In this technique, the user is first asked to provide his/her expected patterns according to his/her past knowledge or intuitive feelings. Given these expectations, the system uses a fuzzy matching technique to match the discovered patterns against the user's expectations, and then rank the discovered patterns according to the matching results. A variety of rankings can be performed for different purposes, such as to confirm the user's knowledge and to identify unexpected patterns, which are by definition interesting. The proposed technique is general and interactive.||Source Title:||IEEE Transactions on Knowledge and Data Engineering||URI:||http://scholarbank.nus.edu.sg/handle/10635/39017||ISSN:||10414347||DOI:||10.1109/69.824588|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 17, 2019
WEB OF SCIENCETM
checked on Oct 10, 2019
checked on Oct 14, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.