Sciweavers

3113 search results - page 235 / 623
» Efficiently Generating Efficient Generating Extensions in Pr...
Sort
View
ICDE
2010
IEEE
428views Database» more  ICDE 2010»
16 years 4 months ago
Supporting Top-K Keyword Search in XML Databases
Keyword search is considered to be an effective information discovery method for both structured and semistructured data. In XML keyword search, query semantics is based on the con...
Liang Jeff Chen, Yannis Papakonstantinou
ICDM
2006
IEEE
176views Data Mining» more  ICDM 2006»
15 years 11 months ago
Razor: mining distance-constrained embedded subtrees
Due to their capability for expressing semantics and relationships among data objects, semi-structured documents have become a common way of representing domain knowledge. Compari...
Henry Tan, Tharam S. Dillon, Fedja Hadzic, Elizabe...
AOSD
2009
ACM
15 years 9 months ago
Flexible calling context reification for aspect-oriented programming
Aspect-oriented programming (AOP) eases the development of profilers, debuggers, and reverse engineering tools. Such tools frequently rely on calling context information. However,...
Alex Villazón, Walter Binder, Philippe More...
147
Voted
CIKM
2008
Springer
15 years 6 months ago
On effective presentation of graph patterns: a structural representative approach
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...
Chen Chen, Cindy Xide Lin, Xifeng Yan, Jiawei Han
149
Voted
SDM
2004
SIAM
207views Data Mining» more  SDM 2004»
15 years 6 months ago
BAMBOO: Accelerating Closed Itemset Mining by Deeply Pushing the Length-Decreasing Support Constraint
Previous study has shown that mining frequent patterns with length-decreasing support constraint is very helpful in removing some uninteresting patterns based on the observation t...
Jianyong Wang, George Karypis