Sciweavers

7053 search results - page 1157 / 1411
» Data Mining
Sort
View
IDA
2010
Springer
15 years 5 months ago
Selecting the Links in BisoNets Generated from Document Collections
According to Koestler, the notion of a bisociation denotes a connection between pieces of information from habitually separated domains or categories. In this paper, we consider a ...
Marc Segond, Christian Borgelt
WWW
2004
ACM
16 years 7 months ago
Affinity rank: a new scheme for efficient web search
Maximizing only the relevance between queries and documents will not satisfy users if they want the top search results to present a wide coverage of topics by a few representative...
Yi Liu, Benyu Zhang, Zheng Chen, Michael R. Lyu, W...
ADBIS
2007
Springer
143views Database» more  ADBIS 2007»
16 years 26 days ago
Aggregating Multiple Instances in Relational Database Using Semi-Supervised Genetic Algorithm-based Clustering Technique
In solving the classification problem in relational data mining, traditional methods, for example, the C4.5 and its variants, usually require data transformations from datasets sto...
Rayner Alfred, Dimitar Kazakov
ICPR
2006
IEEE
16 years 7 months ago
Scalable Representative Instance Selection and Ranking
Finding a small set of representative instances for large datasets can bring various benefits to data mining practitioners so they can (1) build a learner superior to the one cons...
Xindong Wu, Xingquan Zhu
SIGMOD
2004
ACM
166views Database» more  SIGMOD 2004»
16 years 6 months ago
Fast Computation of Database Operations using Graphics Processors
We present new algorithms on commodity graphics processors to perform fast computation of several common database operations. Specifically, we consider operations such as conjunct...
Naga K. Govindaraju, Brandon Lloyd, Wei Wang 0010,...
« Prev « First page 1157 / 1411 Last » Next »