Sciweavers

3311 search results - page 53 / 663
» Modeling Relational Data by the Adjacency Model
Sort
View
ICDM
2010
IEEE
217views Data Mining» more  ICDM 2010»
13 years 7 months ago
Discovering Temporal Features and Relations of Activity Patterns
An important problem that arises during the data mining process in many new emerging application domains is mining data with temporal dependencies. One such application domain is a...
Ehsan Nazerfard, Parisa Rashidi, Diane J. Cook
RR
2007
Springer
14 years 3 months ago
Efficiently Querying Relational Databases Using OWL and SWRL
For the foreseeable future, most data will continue to be stored in relational databases. To work with these data in ontology-based applications, tools and techniques that bridge t...
Martin J. O'Connor, Ravi Shankar, Samson W. Tu, Cs...
SPAA
2009
ACM
14 years 9 months ago
On randomized representations of graphs using short labels
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
Pierre Fraigniaud, Amos Korman
ICDE
1996
IEEE
120views Database» more  ICDE 1996»
14 years 10 months ago
Towards the Reverse Engineering of Denormalized Relational Databases
This paper describes a method to cope with denormalized relational schemas in a database reverse engineering process. We propose two main steps to irnprove the understanding of da...
Jean-Marc Petit, Farouk Toumani, Jean-Franç...
SP
2002
IEEE
128views Security Privacy» more  SP 2002»
13 years 8 months ago
Fitting hidden Markov models to psychological data
Markov models have been used extensively in psychology of learning. Applications of hidden Markov models are rare however. This is partially due to the fact that comprehensive stat...
Ingmar Visser, Maartje E. J. Raijmakers, Peter C. ...