Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
Efficient discovery of optimal word-association patterns in large text databases
Autore:
Shimozono, S; Arimura, H; Arikawa, S;
Indirizzi:
Kyushu Inst Technol, Dept Artificial Intelligence, Iizuka, Fukuoka 8208502, Japan Kyushu Inst Technol Iizuka Fukuoka Japan 8208502 , Fukuoka 8208502, Japan Kyushu Univ, Dept Informat, Fukuoka 8128581, Japan Kyushu Univ Fukuoka Japan 8128581 Dept Informat, Fukuoka 8128581, Japan Japan Sci & Technol Corp, Precursory Res Embryon Sci & Technol, Osaka, Japan Japan Sci & Technol Corp Osaka Japan mbryon Sci & Technol, Osaka, Japan
Titolo Testata:
NEW GENERATION COMPUTING
fascicolo: 1, volume: 18, anno: 2000,
pagine: 49 - 60
SICI:
0288-3635(2000)18:1<49:EDOOWP>2.0.ZU;2-C
Fonte:
ISI
Lingua:
ENG
Soggetto:
APPROXIMATION; OPTIMIZATION; ALGORITHM;
Keywords:
text databases; data mining; optimization; proximity word-association patterns; discovery science;
Tipo documento:
Article
Natura:
Periodico
Settore Disciplinare:
Engineering, Computing & Technology
Citazioni:
14
Recensione:
Indirizzi per estratti:
Indirizzo: Shimozono, S Kyushu Inst Technol, Dept Artificial Intelligence, Iizuka, Fukuoka 8208502, Japan Kyushu Inst Technol Iizuka Fukuoka Japan 8208502 8502, Japan
Citazione:
S. Shimozono et al., "Efficient discovery of optimal word-association patterns in large text databases", NEW GEN COM, 18(1), 2000, pp. 49-60

Abstract

We study efficient discovery of proximity word-association patterns, defined by a sequence of strings and a proximity gap, from a collection of textswith the positive and the negative labels. We present an algorithm that finds all d-strings k-proximity word-association patterns that maximize the number of texts whose matching agree with their labels. It runs in expected time complexity O(k(d-1) n log(d) n) and space O(k(d-1)n) with the total length n of texts, if texts are uniformly random strings. We also show that the problem to find one of the best word-association patterns with arbitrarily many strings is MAX SNP-hard.

ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 27/01/20 alle ore 17:09:37