Sciweavers

995 search results - page 60 / 199
» String Pattern Discovery
Sort
View
ICDCN
2011
Springer
12 years 11 months ago
Mining Frequent Subgraphs to Extract Communication Patterns in Data-Centres
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...
Maitreya Natu, Vaishali P. Sadaphal, Sangameshwar ...
HICSS
2003
IEEE
167views Biometrics» more  HICSS 2003»
14 years 29 days ago
Discovering Group Interaction Patterns in a Teachers Professional Community
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...
Fu-ren Lin, Chun-Hung Chen, Kuo-Lung Tsai
FQAS
2004
Springer
146views Database» more  FQAS 2004»
13 years 11 months ago
Discovering Representative Models in Large Time Series Databases
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 ...
Simona E. Rombo, Giorgio Terracina
ICASSP
2011
IEEE
12 years 11 months ago
Unsupervised vocabulary discovery using non-negative matrix factorization with graph regularization
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...
Meng Sun, Hugo Van hamme
CPM
2005
Springer
87views Combinatorics» more  CPM 2005»
14 years 1 months ago
Two Dimensional Parameterized Matching
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-...
Carmit Hazay, Moshe Lewenstein, Dekel Tsur