Sciweavers

1347 search results - page 39 / 270
» Using Clustering Methods for Discovering Event Structures
Sort
View
ICMCS
2005
IEEE
120views Multimedia» more  ICMCS 2005»
14 years 2 months ago
KPYR: An Efficient Indexing Method
Motivated by the needs for efficient indexing structures adapted to real applications in video database, we present a new indexing structure named Kpyr. In Kpyr, we use a clusteri...
Thierry Urruty, Fatima Belkouch, Chabane Djeraba
JIIS
2000
119views more  JIIS 2000»
13 years 8 months ago
Knowledge Discovery from Series of Interval Events
Knowledge discovery from data sets can be extensively automated by using data mining software tools. Techniques for mining series of interval events, however, have not been conside...
Roy Villafane, Kien A. Hua, Duc A. Tran, Basab Mau...
ICDM
2007
IEEE
166views Data Mining» more  ICDM 2007»
14 years 2 months ago
A Divisive Hierarchical Structural Clustering Algorithm for Networks
Many systems in sciences, engineering and nature can be modeled as networks. Examples are internet, metabolic networks and social networks. Network clustering algorithms aimed to ...
Nurcan Yuruk, Mutlu Mete, Xiaowei Xu, Thomas A. J....
IFM
2009
Springer
158views Formal Methods» more  IFM 2009»
14 years 3 months ago
Developing Topology Discovery in Event-B
Abstract. We present a formal development in Event-B of a distributed topology discovery algorithm. Distributed topology discovery is at the core of several routing algorithms and ...
Thai Son Hoang, Hironobu Kuruma, David A. Basin, J...
DAWAK
2004
Springer
14 years 7 days ago
PROWL: An Efficient Frequent continuity Mining Algorithm on Event Sequences
Mining association rule in event sequences is an important data mining problem with many applications. Most of previous studies on association rules are on mining intra-transaction...
Kuo-Yu Huang, Chia-Hui Chang, Kuo-Zui Lin