2635 search results - page 286 / 527 » Algorithms for the Database Layout Problem |
188
click to vote
DASFAA
2003
IEEE
15 years 12 months ago
2003
IEEE
Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...
177
click to vote
SIGMOD
1998
ACM
15 years 10 months ago
1998
ACM
Semistructured data is characterized by the lack of any fixed and rigid schema, although typically the data hassomeimplicitstructure. While thelack offixedschemamakesextracting ...
154
click to vote
SIGMOD
1997
ACM
15 years 10 months ago
1997
ACM
One of the most well-studied problems in data mining is mining for association rules in market basket data. Association rules, whose significance is measured via support and confi...
142
click to vote
VLDB
1997
ACM
15 years 10 months ago
1997
ACM
Many sources on the Internet and elsewhere rank the objects in query results according to how well these objects match the original query. For example, a real-estate agent might r...
192
click to vote
ACII
2005
Springer
15 years 8 months ago
2005
Springer
The null space N(St) of total scatter matrix St contains no useful information for pattern classification. So, discarding the null space N(St) results in dimensionality reduction ...