Sciweavers

1060 search results - page 72 / 212
» On the Discovery of Random Trees
Sort
View
KDD
2005
ACM
103views Data Mining» more  KDD 2005»
15 years 3 months ago
Key semantics extraction by dependency tree mining
We propose a new text mining system which extracts characteristic contents from given documents. We define Key semantics as characteristic sub-structures of syntactic dependencie...
Satoshi Morinaga, Hiroki Arimura, Takahiro Ikeda, ...
SIGECOM
2009
ACM
109views ECommerce» more  SIGECOM 2009»
15 years 4 months ago
A new perspective on implementation by voting trees
Voting trees describe an iterative procedure for selecting a single vertex from a tournament. vide a very general abstract model of decision-making among a group of individuals, a...
Felix A. Fischer, Ariel D. Procaccia, Alex Samorod...
ALGORITHMICA
2002
94views more  ALGORITHMICA 2002»
14 years 10 months ago
The Quantum Black-Box Complexity of Majority
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...
Thomas P. Hayes, Samuel Kutin, Dieter van Melkebee...
EDBT
2009
ACM
138views Database» more  EDBT 2009»
15 years 4 months ago
FOGGER: an algorithm for graph generator discovery
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
Zhiping Zeng, Jianyong Wang, Jun Zhang, Lizhu Zhou
CIKM
2009
Springer
15 years 2 months ago
Efficient itemset generator discovery over a stream sliding window
Mining generator patterns has raised great research interest in recent years. The main purpose of mining itemset generators is that they can form equivalence classes together with...
Chuancong Gao, Jianyong Wang