Sciweavers

2131 search results - page 95 / 427
» Immunity for Closed Sets
Sort
View
KDD
2007
ACM
179views Data Mining» more  KDD 2007»
15 years 11 months ago
Mining statistically important equivalence classes and delta-discriminative emerging patterns
The support-confidence framework is the most common measure used in itemset mining algorithms, for its antimonotonicity that effectively simplifies the search lattice. This com...
Jinyan Li, Guimei Liu, Limsoon Wong
ICFCA
2009
Springer
15 years 11 months ago
Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice
Formal concept analysis (FCA) is increasingly applied to data mining problems, essentially as a formal framework for mining reduced representations (bases) of target pattern famili...
Jaume Baixeries, Laszlo Szathmary, Petko Valtchev,...
AH
2004
Springer
15 years 10 months ago
The Personal Reader: Personalizing and Enriching Learning Resources Using Semantic Web Technologies.
Traditional adaptive hypermedia systems have focused on providing adaptation functionality on a closed corpus, while Web search interfaces have delivered non-personalized informati...
Peter Dolog, Nicola Henze, Wolfgang Nejdl, Michael...
VL
2003
IEEE
134views Visual Languages» more  VL 2003»
15 years 10 months ago
End-user programming as translation: an experimental framework and study
One of the reputed advantages of end-user programming languages is that they support a given problem doh a set of programming abstractions that are “just right” for the end-us...
Christopher D. Hundhausen, Ravikiran Vatrapu, Josh...
ECCV
2010
Springer
15 years 9 months ago
Building Compact Local Pairwise Codebook with Joint Feature Space Clustering
Abstract. This paper presents a simple, yet effective method of building a codebook for pairs of spatially close SIFT descriptors. Integrating such codebook into the popular bag-o...