Sciweavers

684 search results - page 4 / 137
» Elimination of Redundant Information for Web Data Mining
Sort
View
COMPSAC
2004
IEEE
13 years 11 months ago
Efficient Partial Multiple Periodic Patterns Mining without Redundant Rules
Partial periodic patterns mining is a very interesting domain in data mining problem. In the previous studies, full and partial multiple periodic patterns mining problems are cons...
Wenpo Yang, Guanling Lee
DAWAK
2010
Springer
13 years 5 months ago
Mining Non-redundant Information-Theoretic Dependencies between Itemsets
Abstract. We present an information-theoretic framework for mining dependencies between itemsets in binary data. The problem of closure-based redundancy in this context is theoreti...
Michael Mampaey
ICDM
2006
IEEE
113views Data Mining» more  ICDM 2006»
14 years 1 months ago
Mining Maximal Generalized Frequent Geographic Patterns with Knowledge Constraints
In frequent geographic pattern mining a large amount of patterns is well known a priori. This paper presents a novel approach for mining frequent geographic patterns without assoc...
Vania Bogorny, João Francisco Valiati, Sand...
IUI
2009
ACM
14 years 4 months ago
You can play that again: exploring social redundancy to derive highlight regions in videos
Identifying highlights in multimedia content such as video and audio is currently a very difficult technical problem. We present and evaluate a novel algorithm that identifies hig...
Jose San Pedro, Vaiva Kalnikaité, Steve Whi...
CORR
2010
Springer
138views Education» more  CORR 2010»
13 years 4 months ago
Rules of Thumb for Information Acquisition from Large and Redundant Data
We develop an abstract model of information acquisition from redundant data. We assume a random sampling process from data which contain information with bias and are interested in...
Wolfgang Gatterbauer