Sciweavers

586 search results - page 69 / 118
» Adding Structure to Unstructured Data
Sort
View
ICDM
2002
IEEE
156views Data Mining» more  ICDM 2002»
14 years 25 days ago
Association Analysis with One Scan of Databases
Mining frequent patterns with an FP-tree avoids costly candidate generation and repeatedly occurrence frequency checking against the support threshold. It therefore achieves bette...
Hao Huang, Xindong Wu, Richard Relue
MOBIDE
2005
ACM
14 years 1 months ago
Tolerance of localization imprecision in efficiently managing mobile sensor databases
Query processing on mobile sensor networks requires efficient indexing and partitioning of the data space to support efficient routing as the network scales up. Building an index ...
Lin Xiao, Aris M. Ouksel
PVLDB
2008
101views more  PVLDB 2008»
13 years 7 months ago
Multidimensional content eXploration
Content Management Systems (CMS) store enterprise data such as insurance claims, insurance policies, legal documents, patent applications, or archival data like in the case of dig...
Alkis Simitsis, Akanksha Baid, Yannis Sismanis, Be...
ICDE
2002
IEEE
104views Database» more  ICDE 2002»
14 years 9 months ago
Efficient Evaluation of Queries with Mining Predicates
Modern relational database systems are beginning to support ad hoc queries on mining models. In this paper, we explore novel techniques for optimizing queries that apply mining mo...
Surajit Chaudhuri, Vivek R. Narasayya, Sunita Sara...
SIGMOD
2009
ACM
189views Database» more  SIGMOD 2009»
14 years 8 months ago
Generic and effective semi-structured keyword search
Current semi-structured keyword search and natural language query processing systems use ad hoc approaches to take advantage of structural information. Although intuitive, they ar...
Arash Termehchy, Marianne Winslett