Sciweavers

39 search results - page 8 / 8
» On Minimal Infrequent Itemset Mining
Sort
View
SIAMCOMP
2000
109views more  SIAMCOMP 2000»
13 years 5 months ago
Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph
Abstract. We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and parti...
Endre Boros, Vladimir Gurvich, Leonid Khachiyan, K...
HICSS
2003
IEEE
171views Biometrics» more  HICSS 2003»
13 years 10 months ago
Improving the Efficiency of Interactive Sequential Pattern Mining by Incremental Pattern Discovery
The discovery of sequential patterns, which extends beyond frequent item-set finding of association rule mining, has become a challenging task due to its complexity. Essentially, ...
Ming-Yen Lin, Suh-Yin Lee
DSS
2007
226views more  DSS 2007»
13 years 5 months ago
Dare to share: Protecting sensitive knowledge with data sanitization
chool of Business Research – FY 2007 Research Abstracts Dare to Share: Protecting Sensitive Knowledge with Data Sanitization Data sanitization is a process that is used to promot...
Ali Amiri
DMKD
1997
ACM
198views Data Mining» more  DMKD 1997»
13 years 9 months ago
Clustering Based On Association Rule Hypergraphs
Clustering in data mining is a discovery process that groups a set of data such that the intracluster similarity is maximized and the intercluster similarity is minimized. These d...
Eui-Hong Han, George Karypis, Vipin Kumar, Bamshad...