Sciweavers

960 search results - page 158 / 192
» CURE: An Efficient Clustering Algorithm for Large Databases
Sort
View
167
Voted
BMCBI
2008
208views more  BMCBI 2008»
15 years 3 months ago
GraphFind: enhancing graph searching by low support data mining techniques
Background: Biomedical and chemical databases are large and rapidly growing in size. Graphs naturally model such kinds of data. To fully exploit the wealth of information in these...
Alfredo Ferro, Rosalba Giugno, Misael Mongiov&igra...
135
Voted
KDD
2006
ACM
122views Data Mining» more  KDD 2006»
16 years 4 months ago
Measuring and extracting proximity in networks
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...
Yehuda Koren, Stephen C. North, Chris Volinsky
148
Voted
KDD
2003
ACM
175views Data Mining» more  KDD 2003»
16 years 4 months ago
Weighted Association Rule Mining using weighted support and significance framework
We address the issues of discovering significant binary relationships in transaction datasets in a weighted setting. Traditional model of association rule mining is adapted to han...
Feng Tao, Fionn Murtagh, Mohsen Farid
145
Voted
EDBT
2006
ACM
182views Database» more  EDBT 2006»
16 years 3 months ago
On High Dimensional Skylines
In many decision-making applications, the skyline query is frequently used to find a set of dominating data points (called skyline points) in a multidimensional dataset. In a high-...
Chee Yong Chan, H. V. Jagadish, Kian-Lee Tan, Anth...
141
Voted
DEXA
2010
Springer
182views Database» more  DEXA 2010»
15 years 3 months ago
Minimum Spanning Tree on Spatio-Temporal Networks
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
Viswanath Gunturi, Shashi Shekhar, Arnab Bhattacha...