Sciweavers

917 search results - page 9 / 184
» Comparison of Data Structures for Computing Formal Concepts
Sort
View
SAC
2010
ACM
14 years 2 months ago
Background knowledge in formal concept analysis: constraints via closure operators
The aim of this short paper is to present a general method of using background knowledge to impose constraints in conceptual clustering of object-attribute relational data. The pr...
Radim Belohlávek, Vilém Vychodil
KDD
1998
ACM
181views Data Mining» more  KDD 1998»
13 years 12 months ago
Approaches to Online Learning and Concept Drift for User Identification in Computer Security
The task in the computer security domain of anomaly detection is to characterize the behaviors of a computer user (the `valid', or `normal' user) so that unusual occurre...
Terran Lane, Carla E. Brodley
FECS
2006
152views Education» more  FECS 2006»
13 years 9 months ago
Infusing Critical Thinking Skill Compare and Contrast into Content of Data Structures Course
This paper describes some of our efforts in infusing the critical thinking skill of comparing and contrasting into a course on data structures. Comparing and contrasting is the pr...
M. R. K. Krishna Rao, Muhammad Shafique, Kanaan A....
ICALP
2004
Springer
14 years 1 months ago
A General Technique for Managing Strings in Comparison-Driven Data Structures
Abstract. This paper presents a general technique for optimally transforming any dynamic data structure D that operates on atomic and indivisible keys by constant-time comparisons,...
Gianni Franceschini, Roberto Grossi
CORR
2008
Springer
87views Education» more  CORR 2008»
13 years 7 months ago
Two-Level Concept-Oriented Data Model
In this paper we describe a new approach to data modelling called the concept-oriented model (CoM). This model is based on the formalism of nested ordered sets which uses inclusion...
Alexandr A. Savinov