Sciweavers

4560 search results - page 363 / 912
» Finding Data in the Neighborhood
Sort
View
ICDM
2009
IEEE
176views Data Mining» more  ICDM 2009»
15 years 4 months ago
SISC: A Text Classification Approach Using Semi Supervised Subspace Clustering
Text classification poses some specific challenges. One such challenge is its high dimensionality where each document (data point) contains only a small subset of them. In this pap...
Mohammad Salim Ahmed, Latifur Khan
KDD
2003
ACM
99views Data Mining» more  KDD 2003»
16 years 7 months ago
Fragments of order
High-dimensional collections of 0-1 data occur in many applications. The attributes in such data sets are typically considered to be unordered. However, in many cases there is a n...
Aristides Gionis, Teija Kujala, Heikki Mannila
RECOMB
2006
Springer
16 years 7 months ago
Efficient Enumeration of Phylogenetically Informative Substrings
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
Stanislav Angelov, Boulos Harb, Sampath Kannan, Sa...
VLDB
2003
ACM
165views Database» more  VLDB 2003»
16 years 7 months ago
Learning to match ontologies on the Semantic Web
On the Semantic Web, data will inevitably come from many different ontologies, and information processing across ontologies is not possible without knowing the semantic mappings be...
AnHai Doan, Jayant Madhavan, Robin Dhamankar, Pedr...
ICDE
2009
IEEE
173views Database» more  ICDE 2009»
15 years 4 months ago
Efficient Mining of Closed Repetitive Gapped Subsequences from a Sequence Database
There is a huge wealth of sequence data available, for example, customer purchase histories, program execution traces, DNA, and protein sequences. Analyzing this wealth of data to ...
Bolin Ding, David Lo, Jiawei Han, Siau-Cheng Khoo