Efficient Mining of Niches and Set Routines
Document Type
Conference Proceeding
Publication Date
4-2001
Find in a Library
Abstract
It is widely recognized that successful businesses usually fall into set routines and become limited by their past. To remain successful, they need to discover new opportunities and niches. Niches aresurprising rules that contradict the set routines; they capture significant, representative client sectors that deserve new, more profitable treatments; they are not merely strong-rule and exception pairs. In this paper we study the efficient mining of set routines and niches. We also introduce a semantic approach to select a set of representative patterns, and present an efficient incremental algorithm to implement the approach.
Repository Citation
Dong, G.,
& Deshpande, K.
(2001). Efficient Mining of Niches and Set Routines. Lecture Notes in Computer Science, 2035, 234-246.
https://corescholar.libraries.wright.edu/knoesis/418
DOI
10.1007/3-540-45357-1_27
Comments
Presented at the 5th Pacific Asia Conference on Advances in Knowledge Discovery and Data Mining, Hong Kong, April 16-18, 2001.