Sciweavers

116 search results - page 7 / 24
» On Computing Condensed Frequent Pattern Bases
Sort
View
PAKDD
2004
ACM
186views Data Mining» more  PAKDD 2004»
14 years 25 days ago
CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees
Abstract. Tree structures are used extensively in domains such as computational biology, pattern recognition, XML databases, computer networks, and so on. One important problem in ...
Yun Chi, Yirong Yang, Yi Xia, Richard R. Muntz
ICDM
2006
IEEE
134views Data Mining» more  ICDM 2006»
14 years 1 months ago
Fast Frequent Free Tree Mining in Graph Databases
Free tree, as a special graph which is connected, undirected and acyclic, is extensively used in domains such as computational biology, pattern recognition, computer networks, XML...
Peixiang Zhao, Jeffrey Xu Yu
ISCI
2008
116views more  ISCI 2008»
13 years 7 months ago
Discovery of maximum length frequent itemsets
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often ...
Tianming Hu, Sam Yuan Sung, Hui Xiong, Qian Fu
SDM
2011
SIAM
223views Data Mining» more  SDM 2011»
12 years 10 months ago
Characterizing Uncertain Data using Compression
Motivated by sensor networks, mobility data, biology and life sciences, the area of mining uncertain data has recently received a great deal of attention. While various papers hav...
Francesco Bonchi, Matthijs van Leeuwen, Antti Ukko...
JUCS
2006
185views more  JUCS 2006»
13 years 7 months ago
The Berlin Brain-Computer Interface: Machine Learning Based Detection of User Specific Brain States
We outline the Berlin Brain-Computer Interface (BBCI), a system which enables us to translate brain signals from movements or movement intentions into control commands. The main co...
Benjamin Blankertz, Guido Dornhege, Steven Lemm, M...