86 search results - page 8 / 18 » Efficient Vertical Mining of Frequent Closures and Generator... |
DKE
2002
13 years 7 months ago
2002
We introduce the notion of iceberg concept lattices and show their use in knowledge discovery in databases. Iceberg lattices are a conceptual clustering method, which is well suit...
AICCSA
2008
IEEE
13 years 7 months ago
2008
IEEE
Mining fault tolerant (FT) frequent patterns from transactional datasets are very complex than mining all frequent patterns (itemsets), in terms of both search space exploration a...
PKDD
2010
Springer
13 years 5 months ago
2010
Springer
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
DBA
2006
13 years 8 months ago
2006
This work discusses the problem of generating association rules from a set of transactions in a relational database, taking performance and accuracy of found results as the essent...
ICDM
2010
IEEE
13 years 5 months ago
2010
IEEE
Discovering patterns in a sequence is an important aspect of data mining. One popular choice of such patterns are episodes, patterns in sequential data describing events that often...