Sciweavers

684 search results - page 5 / 137
» Elimination of Redundant Information for Web Data Mining
Sort
View
KDD
2008
ACM
239views Data Mining» more  KDD 2008»
14 years 8 months ago
Mining adaptively frequent closed unlabeled rooted trees in data streams
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
Albert Bifet, Ricard Gavaldà
ICTAI
1997
IEEE
13 years 11 months ago
Web Mining: Information and Pattern Discovery on the World Wide Web
Application of data mining techniques to the World Wide Web, referred to as Web mining, has been the focus of several recent research projects and papers. However, there is no est...
Robert Cooley, Bamshad Mobasher, Jaideep Srivastav...
WEBDB
2010
Springer
156views Database» more  WEBDB 2010»
14 years 18 days ago
Redundancy-Driven Web Data Extraction and Integration
A large number of web sites publish pages containing structured information about recognizable concepts, but these data are only partially used by current applications. Although s...
Paolo Papotti, Valter Crescenzi, Paolo Merialdo, M...
WWW
2010
ACM
13 years 7 months ago
Exploiting content redundancy for web information extraction
We propose a novel extraction approach that exploits content redundancy on the web to extract structured data from template-based web sites. We start by populating a seed database...
Pankaj Gulhane, Rajeev Rastogi, Srinivasan H. Seng...
CLA
2004
13 years 9 months ago
Using Concept Formal Analysis for Cooperative Information Retrieval
cessary to abstract it and eliminate the redundancy data. In this context, a method for data reduction based on the formal concept analysis is proposed in [16,17]. At the same time...
Ibtissem Nafkha, Samir Elloumi, Ali Jaoua