Sciweavers

1126 search results - page 199 / 226
» Strong Feature Sets from Small Samples
Sort
View
CIKM
2006
Springer
13 years 9 months ago
Efficiently clustering transactional data with weighted coverage density
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
Hua Yan, Keke Chen, Ling Liu
JASIS
2011
103views more  JASIS 2011»
13 years 2 months ago
Using global mapping to create more accurate document-level maps of research fields
We describe two general approaches to creating document-level maps of science. To create a local map one defines and directly maps a sample of data, such as all literature publish...
Richard Klavans, Kevin W. Boyack
SIGCOMM
1991
ACM
13 years 11 months ago
IP-Based Protocols for Mobile Internetworking
We consider the problem of providing network access to hosts whose physical location changes with time. Such hosts cannot depend on traditional forms of network connectivity and r...
John Ioannidis, Dan Duchamp, Gerald Q. Maguire Jr.
ENGL
2007
101views more  ENGL 2007»
13 years 7 months ago
Multiresolution Knowledge Mining using Wavelet Transform
— Most research in Knowledge Mining deal with the basic models like clustering, classification, regression, association rule mining and so on. In the process of quest for knowled...
R. Pradeep Kumar, P. Nagabhushan
BMCBI
2008
101views more  BMCBI 2008»
13 years 7 months ago
Reranking candidate gene models with cross-species comparison for improved gene prediction
Background: Most gene finders score candidate gene models with state-based methods, typically HMMs, by combining local properties (coding potential, splice donor and acceptor patt...
Qian Liu, Koby Crammer, Fernando C. N. Pereira, Da...