276 search results - page 11 / 56 » Frequent Submap Discovery |
ICDM
2007
IEEE
14 years 4 months ago
2007
IEEE
This paper introduces a new technique of document clustering based on frequent senses. The proposed system, GDClust (Graph-Based Document Clustering) works with frequent senses ra...
IUI
2012
ACM
12 years 5 months ago
2012
ACM
In the digital age, users can have perfect recall of their digital experiences. In this paper, we explore how this recall can be leveraged during web browsing. We have built a sys...
KDD
2009
ACM
14 years 4 months ago
2009
ACM
Over the past 15 years, numerous algorithms have been proposed for frequent pattern mining as it plays an essential role in many knowledge discovery and data mining (KDD) tasks. M...
ICDM
2005
IEEE
14 years 3 months ago
2005
IEEE
The discovery of frequent patterns is a famous problem in data mining. While plenty of algorithms have been proposed during the last decade, only a few contributions have tried to...
KDD
2005
ACM
14 years 10 months ago
2005
ACM
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...