Sciweavers

7150 search results - page 1152 / 1430
» Graph-Based Data Mining
Sort
View
ICDM
2008
IEEE
123views Data Mining» more  ICDM 2008»
14 years 3 months ago
Discovering Flow Anomalies: A SWEET Approach
Given a percentage-threshold and readings from a pair of consecutive upstream and downstream sensors, flow anomaly discovery identifies dominant time intervals where the fractio...
James M. Kang, Shashi Shekhar, Christine Wennen, P...
AUSDM
2007
Springer
100views Data Mining» more  AUSDM 2007»
14 years 3 months ago
An E-Market Framework to Determine the Strength of Business Relationships between Intelligent Agents
When an agent enters in an e-Market for the first time, it has no historical information that can be used to determine the strength of business relationship with participant agen...
Khandaker Shahidul Islam
ICDM
2006
IEEE
132views Data Mining» more  ICDM 2006»
14 years 3 months ago
High Quality, Efficient Hierarchical Document Clustering Using Closed Interesting Itemsets
High dimensionality remains a significant challenge for document clustering. Recent approaches used frequent itemsets and closed frequent itemsets to reduce dimensionality, and to...
Hassan H. Malik, John R. Kender
CIKM
2009
Springer
14 years 2 months ago
Probabilistic models for topic learning from images and captions in online biomedical literatures
Biomedical images and captions are one of the major sources of information in online biomedical publications. They often contain the most important results to be reported, and pro...
Xin Chen, Caimei Lu, Yuan An, Palakorn Achananupar...
PKDD
1999
Springer
106views Data Mining» more  PKDD 1999»
14 years 1 months ago
Heuristic Measures of Interestingness
When mining a large database, the number of patterns discovered can easily exceed the capabilities of a human user to identify interesting results. To address this problem, variou...
Robert J. Hilderman, Howard J. Hamilton
« Prev « First page 1152 / 1430 Last » Next »