Sciweavers

7150 search results - page 809 / 1430
» Graph-Based Data Mining
Sort
View
KDD
2002
ACM
155views Data Mining» more  KDD 2002»
16 years 7 months ago
SyMP: an efficient clustering approach to identify clusters of arbitrary shapes in large data sets
We propose a new clustering algorithm, called SyMP, which is based on synchronization of pulse-coupled oscillators. SyMP represents each data point by an Integrate-and-Fire oscill...
Hichem Frigui
ICDM
2009
IEEE
125views Data Mining» more  ICDM 2009»
16 years 1 months ago
A Fully Automated Method for Discovering Community Structures in High Dimensional Data
—Identifying modules, or natural communities, in large complex networks is fundamental in many fields, including social sciences, biological sciences and engineering. Recently s...
Jianhua Ruan
DASFAA
2005
IEEE
157views Database» more  DASFAA 2005»
16 years 26 days ago
Adaptively Detecting Aggregation Bursts in Data Streams
Finding bursts in data streams is attracting much attention in research community due to its broad applications. Existing burst detection methods suffer the problems that 1) the p...
Aoying Zhou, Shouke Qin, Weining Qian
KDD
2004
ACM
213views Data Mining» more  KDD 2004»
16 years 18 days ago
Analytical view of business data
This paper describes a logical extension to Microsoft Business Framework (MBF) called Analytical View (AV). AV consists of three components: Model Service for design time, Busines...
Adam Yeh, Jonathan Tang, Youxuan Jin, Sam Skrivan
ICDM
2010
IEEE
115views Data Mining» more  ICDM 2010»
15 years 5 months ago
Polishing the Right Apple: Anytime Classification Also Benefits Data Streams with Constant Arrival Times
Classification of items taken from data streams requires algorithms that operate in time sensitive and computationally constrained environments. Often, the available time for class...
Jin Shieh, Eamonn J. Keogh