Sciweavers

820 search results - page 7 / 164
» Finding low-utility data structures
Sort
View
ICPR
2002
IEEE
14 years 9 months ago
Prototype Selection for Finding Efficient Representations of Dissimilarity Data
The nearest neighbor (NN) rule is a simple and intuitive method for solving classification problems. Originally, it uses distances to the complete training set. It performs well, ...
Elzbieta Pekalska, Robert P. W. Duin
BIBE
2006
IEEE
112views Bioinformatics» more  BIBE 2006»
14 years 2 months ago
Finding Correlations in Functionally Equivalent Proteins by Integrating Automated and Visual Data Exploration
The analysis of alignments of functionally equivalent proteins can reveal regularities such as correlated positions or residue patterns which are important to ensure a specific f...
Daniel A. Keim, Daniela Oelke, Royal Truman, Klaus...
FCT
2001
Springer
14 years 1 months ago
Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables
Many documents such as Web documents or XML files have tree structures. A term tree is an unordered tree pattern consisting of internal variables and tree structures. In order to ...
Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miya...
SIGMOD
2008
ACM
164views Database» more  SIGMOD 2008»
14 years 8 months ago
Finding frequent items in probabilistic data
Computing statistical information on probabilistic data has attracted a lot of attention recently, as the data generated from a wide range of data sources are inherently fuzzy or ...
Qin Zhang, Feifei Li, Ke Yi
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
14 years 9 months ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...