33 search results - page 6 / 7 » Finding All Frequent Patterns Starting from the Closure |
142
Voted
IWCIA
2009
Springer
15 years 8 months 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...
128
Voted
JSS
2006
15 years 1 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...
106
click to vote
EMNLP
2010
14 years 11 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...
120
Voted
ICML
1996
IEEE
16 years 2 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...
105
Voted
BIODATAMINING
2008
15 years 1 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...