Sciweavers

688 search results - page 14 / 138
» Comparison of Conceptual Graphs
Sort
View
APCCM
2008
15 years 5 months ago
A Conceptual Model for Multidimensional Data
This paper introduces a Conceptual Data Model for Data Warehouse including multidimensional aggregation. It is based on Entity-Relationships data model. The conceptual data model ...
Anand S. Kamble
CNSR
2007
IEEE
128views Communications» more  CNSR 2007»
15 years 10 months ago
A Novel Approach for Frequent Phrase Mining in Web Search Engine Query Streams
In this paper, conceptual frequency rate, a new frequency definition suitable for query stream mining, is introduced. An online single-pass algorithm called OFSD (Online Frequent...
M. Barouni-Ebrahimi, Ali A. Ghorbani
WAIM
2010
Springer
15 years 2 months ago
HyperGraphDB: A Generalized Graph Database
We present HyperGraphDB, a novel graph database based on generalized hypergraphs where hyperedges can contain other hyperedges. This generalization automatically reifies every ent...
Borislav Iordanov
140
Voted
CIDM
2009
IEEE
15 years 7 months ago
Empirical comparison of graph classification algorithms
The graph classification problem is learning to classify separate, individual graphs in a graph database into two or more categories. A number of algorithms have been introduced fo...
Nikhil S. Ketkar, Lawrence B. Holder, Diane J. Coo...
WAW
2009
Springer
138views Algorithms» more  WAW 2009»
15 years 10 months ago
Information Theoretic Comparison of Stochastic Graph Models: Some Experiments
The Modularity-Q measure of community structure is known to falsely ascribe community structure to random graphs, at least when it is naively applied. Although Q is motivated by a ...
Kevin J. Lang