33 search results - page 6 / 7 » Finding All Frequent Patterns Starting from the Closure |
IWCIA
2009
Springer
14 years 25 days ago
2009
Springer
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
JSS
2006
13 years 6 months ago
2006
Recent progress of computer and network technologies makes it possible to store and retrieve a large volume of multimedia data in many applications. In such applications, efficien...
EMNLP
2010
13 years 4 months ago
2010
Although many algorithms have been developed to harvest lexical resources, few organize the mined terms into taxonomies. We propose (1) a semi-supervised algorithm that uses a roo...
ICML
1996
IEEE
14 years 7 months ago
1996
IEEE
Finding structure in multiple streams of data is an important problem. Consider the streams of data owing from a robot's sensors, the monitors in an intensive care unit, or p...
BIODATAMINING
2008
13 years 6 months ago
2008
Background: Agglomerative hierarchical clustering (AHC) is a common unsupervised data analysis technique used in several biological applications. Standard AHC methods require that...