Sciweavers

23098 search results - page 4258 / 4620
» Component Based Development
Sort
View
KDD
2008
ACM
264views Data Mining» more  KDD 2008»
16 years 7 months ago
Stable feature selection via dense feature groups
Many feature selection algorithms have been proposed in the past focusing on improving classification accuracy. In this work, we point out the importance of stable feature selecti...
Lei Yu, Chris H. Q. Ding, Steven Loscalzo
KDD
2007
ACM
148views Data Mining» more  KDD 2007»
16 years 7 months ago
Detecting research topics via the correlation between graphs and texts
In this paper we address the problem of detecting topics in large-scale linked document collections. Recently, topic detection has become a very active area of research due to its...
Yookyung Jo, Carl Lagoze, C. Lee Giles
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
16 years 7 months ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos
KDD
2006
ACM
155views Data Mining» more  KDD 2006»
16 years 7 months ago
Camouflaged fraud detection in domains with complex relationships
We describe a data mining system to detect frauds that are camouflaged to look like normal activities in domains with high number of known relationships. Examples include accounti...
Sankar Virdhagriswaran, Gordon Dakin
CHI
2005
ACM
16 years 7 months ago
Interaction design for literature-based discovery
Rapid growth in the scientific literature makes it increasingly difficult for scientists to keep abreast of findings outside their own narrowing fields of expertise. To help biome...
Meredith M. Skeels, Kiera Henning, Meliha Yetisgen...
« Prev « First page 4258 / 4620 Last » Next »