Sciweavers

106 search results - page 8 / 22
» Adaptive Interest Management via Push-Pull Algorithms
Sort
View
SAC
2010
ACM
15 years 4 months ago
Background knowledge in formal concept analysis: constraints via closure operators
The aim of this short paper is to present a general method of using background knowledge to impose constraints in conceptual clustering of object-attribute relational data. The pr...
Radim Belohlávek, Vilém Vychodil
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
15 years 10 months ago
Mining discrete patterns via binary matrix factorization
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Bao-Hong Shen, Shuiwang Ji, Jieping Ye
COMPGEOM
2006
ACM
15 years 3 months ago
Colored intersection searching via sparse rectangular matrix multiplication
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
Haim Kaplan, Micha Sharir, Elad Verbin
109
Voted
JCM
2006
144views more  JCM 2006»
14 years 9 months ago
Using Micro-Genetic Algorithms to Improve Localization in Wireless Sensor Networks
Wireless sensor networks are widely adopted in many location-sensitive applications including disaster management, environmental monitoring, military applications where the precise...
Vincent Tam, King-Yip Cheng, King-Shan Lui
EDBT
2008
ACM
206views Database» more  EDBT 2008»
15 years 9 months ago
Designing an inductive data stream management system: the stream mill experience
There has been much recent interest in on-line data mining. Existing mining algorithms designed for stored data are either not applicable or not effective on data streams, where r...
Hetal Thakkar, Barzan Mozafari, Carlo Zaniolo