Sciweavers

728 search results - page 19 / 146
» Mining for Empty Rectangles in Large Data Sets
Sort
View
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 5 months ago
Personalized Data Set for Analysis
Data Management portfolio within an organization has seen an upsurge in initiatives for compliance, security, repurposing and storage within and outside the organization. When suc...
Vishal Gupta, Ashutosh Saxena
DAGSTUHL
2007
13 years 9 months ago
Subspace outlier mining in large multimedia databases
Abstract. Increasingly large multimedia databases in life sciences, ecommerce, or monitoring applications cannot be browsed manually, but require automatic knowledge discovery in d...
Ira Assent, Ralph Krieger, Emmanuel Müller, T...
KDD
2008
ACM
274views Data Mining» more  KDD 2008»
14 years 8 months ago
Data mining using high performance data clouds: experimental studies using sector and sphere
We describe the design and implementation of a high performance cloud that we have used to archive, analyze and mine large distributed data sets. By a cloud, we mean an infrastruc...
Robert L. Grossman, Yunhong Gu
KDD
2006
ACM
107views Data Mining» more  KDD 2006»
14 years 8 months ago
Out-of-core frequent pattern mining on a commodity PC
In this work we focus on the problem of frequent itemset mining on large, out-of-core data sets. After presenting a characterization of existing out-of-core frequent itemset minin...
Gregory Buehrer, Srinivasan Parthasarathy, Amol Gh...
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
14 years 8 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han