Sciweavers

243 search results - page 7 / 49
» Scalable mining of large disk-based graph databases
Sort
View
CIKM
2009
Springer
14 years 2 months ago
Independent informative subgraph mining for graph information retrieval
In order to enable scalable querying of graph databases, intelligent selection of subgraphs to index is essential. An improved index can reduce response times for graph queries si...
Bingjun Sun, Prasenjit Mitra, C. Lee Giles
ICDM
2009
IEEE
197views Data Mining» more  ICDM 2009»
13 years 5 months ago
A Linear-Time Graph Kernel
The design of a good kernel is fundamental for knowledge discovery from graph-structured data. Existing graph kernels exploit only limited information about the graph structures bu...
Shohei Hido, Hisashi Kashima
KDD
2002
ACM
171views Data Mining» more  KDD 2002»
14 years 8 months ago
Mining complex models from arbitrarily large databases in constant time
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
Geoff Hulten, Pedro Domingos
KDD
2005
ACM
124views Data Mining» more  KDD 2005»
14 years 8 months ago
Scalable discovery of hidden emails from large folders
The popularity of email has triggered researchers to look for ways to help users better organize the enormous amount of information stored in their email folders. One challenge th...
Giuseppe Carenini, Raymond T. Ng, Xiaodong Zhou
SAC
2005
ACM
14 years 1 months ago
Mining concept associations for knowledge discovery in large textual databases
In this paper, we describe a new approach for mining concept associations from large text collections. The concepts are short sequences of words that occur frequently together acr...
Xiaowei Xu, Mutlu Mete, Nurcan Yuruk