46 search results - page 6 / 10 » Performance Comparison of Pattern Discovery Methods on Web L... |
KDD
2002
ACM
14 years 9 months ago
2002
ACM
Mining frequent trees is very useful in domains like bioinformatics, web mining, mining semi-structured data, and so on. We formulate the problem of mining (embedded) subtrees in ...
WWW
2009
ACM
14 years 1 months ago
2009
ACM
Fully automatic methods that extract lists of objects from the Web have been studied extensively. Record extraction, the first step of this object extraction process, identifies...
ADC
2003
Springer
14 years 2 months ago
2003
Springer
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
ICCS
2003
Springer
14 years 2 months ago
2003
Springer
The association mining is one of the primary sub-areas in the field of data mining. This technique had been used in numerous practical applications, including consumer market baske...
KDD
2002
ACM
14 years 9 months ago
2002
ACM
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...