995 search results - page 60 / 199 » String Pattern Discovery |
148
click to vote
ICDCN
2011
Springer
14 years 5 months ago
2011
Springer
In this paper, we propose to use graph-mining techniques to understand the communication pattern within a data-centre. We model the communication observed within a data-centre as a...
108
click to vote
HICSS
2003
IEEE
15 years 7 months ago
2003
IEEE
Managers and group leaders of a community may not have enough information to help them direct the community development. In this paper, we adopt social network analysis, graph the...
143
click to vote
FQAS
2004
Springer
15 years 5 months ago
2004
Springer
The discovery of frequently occurring patterns in a time series could be important in several application contexts. As an example, the analysis of frequent patterns in biomedical ...
122
click to vote
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
In this paper, we present a model for unsupervised pattern discovery using non-negative matrix factorization (NMF) with graph regularization. Though the regularization can be appl...
120
click to vote
CPM
2005
Springer
15 years 7 months ago
2005
Springer
Two equal length strings, or two equal sized two-dimensional texts, parameterize match (p-match) if there is a one-one mapping (relative to the alphabet) of their characters. Two-...