Sciweavers

1969 search results - page 353 / 394
» Challenges in Enterprise Search
Sort
View
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
14 years 8 months ago
Efficient closed pattern mining in the presence of tough block constraints
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbase...
Krishna Gade, Jianyong Wang, George Karypis
KDD
2004
ACM
164views Data Mining» more  KDD 2004»
14 years 8 months ago
Discovering complex matchings across web query interfaces: a correlation mining approach
To enable information integration, schema matching is a critical step for discovering semantic correspondences of attributes across heterogeneous sources. While complex matchings ...
Bin He, Kevin Chen-Chuan Chang, Jiawei Han
KDD
2004
ACM
114views Data Mining» more  KDD 2004»
14 years 8 months ago
Scalable mining of large disk-based graph databases
Mining frequent structural patterns from graph databases is an interesting problem with broad applications. Most of the previous studies focus on pruning unfruitful search subspac...
Chen Wang, Wei Wang 0009, Jian Pei, Yongtai Zhu, B...
CHI
2006
ACM
14 years 8 months ago
Error correction of voicemail transcripts in SCANMail
Despite its widespread use, voicemail presents numerous usability challenges: People must listen to messages in their entirety, they cannot search by keywords, and audio files do ...
Moira Burke, Brian Amento, Philip L. Isenhour
RECOMB
2006
Springer
14 years 8 months ago
A Parsimony Approach to Genome-Wide Ortholog Assignment
The assignment of orthologous genes between a pair of genomes is a fundamental and challenging problem in comparative genomics, since many computational methods for solving various...
Zheng Fu, Xin Chen, Vladimir Vacic, Peng Nan, Yang...