Sciweavers

820 search results - page 65 / 164
» Finding low-utility data structures
Sort
View
SIGSOFT
2005
ACM
14 years 2 months ago
Detecting higher-level similarity patterns in programs
Cloning in software systems is known to create problems during software maintenance. Several techniques have been proposed to detect the same or similar code fragments in software...
Hamid Abdul Basit, Stan Jarzabek
TIP
2002
179views more  TIP 2002»
13 years 8 months ago
Unsupervised image classification, segmentation, and enhancement using ICA mixture models
An unsupervised classification algorithm is derived by modeling observed data as a mixture of several mutually exclusive classes that are each described by linear combinations of i...
Te-Won Lee, Michael S. Lewicki
KDD
1998
ACM
146views Data Mining» more  KDD 1998»
14 years 1 months ago
Mining Association Rules in Hypertext Databases
In this workweproposea generalisation of the notion of associationrule in the contextof flat transactions to that of a compositeassociation rule in the context of a structured dir...
José Borges, Mark Levene
LREC
2008
174views Education» more  LREC 2008»
13 years 10 months ago
UnsuParse: unsupervised Parsing with unsupervised Part of Speech Tagging
Based on simple methods such as observing word and part of speech tag co-occurrence and clustering, we generate syntactic parses of sentences in an entirely unsupervised and self-...
Christian Hänig, Stefan Bordag, Uwe Quasthoff
ICONIP
2004
13 years 10 months ago
Non-linear Dimensionality Reduction by Locally Linear Isomaps
Algorithms for nonlinear dimensionality reduction (NLDR) find meaningful hidden low-dimensional structures in a high-dimensional space. Current algorithms for NLDR are Isomaps, Loc...
Ashutosh Saxena, Abhinav Gupta, Amitabha Mukerjee