Automated event clustering and quality screening of consumer pictures for digital albuming

2003 ◽  
Vol 5 (3) ◽  
pp. 390-402 ◽  
Author(s):  
A.C. Loui ◽  
A. Savakis
Keyword(s):  
2014 ◽  
Vol 23 (1) ◽  
pp. 59-73
Author(s):  
E. Umamaheswari ◽  
T.V. Geetha

AbstractTraditional document clustering algorithms consider text-based features such as unique word count, concept count, etc. to cluster documents. Meanwhile, event mining is the extraction of specific events, their related sub-events, and the associated semantic relations from documents. This work discusses an approach to event mining through clustering. The Universal Networking Language (UNL)-based subgraph, a semantic representation of the document, is used as the input for clustering. Our research focuses on exploring the use of three different feature sets for event clustering and comparing the approaches used for specific event mining. In our previous work, the clustering algorithm used UNL-based event semantics to represent event context for clustering. However, this approach resulted in different events with similar semantics being clustered together. Hence, instead of considering only UNL event semantics, we considered assigning additional weights to similarity between event contexts with event-related attributes such as time, place, and persons. Although we get specific events in a single cluster, sub-events related to the specific events are not necessarily in a single cluster. Therefore, to improve our cluster efficiency, connective terms between two sentences and their representation as UNL subgraphs were also considered for similarity determination. By combining UNL semantics, event-specific arguments similarity, and connective term concepts between sentences, we were able to obtain clusters for specific events and their sub-events. We have used 112 000 Tamil documents from the Forum for Information Retrieval Evaluation data corpus and achieved good results. We have also compared our approach with the previous state-of-the-art approach for Router-RCV1 corpus and achieved 30% improvements in precision.


Author(s):  
Venkata Ramana Sarella ◽  
Deshai Nakka ◽  
Sekhar B. V. D. S. ◽  
Krishna Rao Sala ◽  
Sameer Chakravarthy V. V. S. S.

Designing various energy-saving routing protocols for real-time internet of things (IoT) applications in modern secure wireless sensor networks (MS-WSN) is a tough task. Many hierarchical protocols for WSNs were not well scalable to large-scale IoT applications. Low energy adaptive two-level-CH clustering hierarchy (LEATCH) is an optimized technique reduces the energy-utilization of few cluster heads, but the LEATCH is not suitable for scalable and dynamic routing. For dynamic routing in MS-WSN, energy efficiency and event clustering adaptive routing protocol (EEECARP) with event-based dynamic clustering and relay communication by selecting intermediates nodes as relay-nodes is necessary. However, EEECARP cannot consider the hop-count, different magnitude ecological conditions, and energy wastage in cluster formation while collisions occur. So, the authors propose the modified EEECARP to address these issues for better dynamic event clustering adaptive routing to improve the lifetime of MS-WSNs. The experimental outcomes show that proposed protocol achieves better results than EEECARP and LEATCH.


Author(s):  
Conrad M. Albrecht ◽  
Marcus Freitag ◽  
Theodore G. van Kessel ◽  
Siyuan Lu ◽  
Hendrik F. Hamann

2015 ◽  
Vol 5 (1) ◽  
Author(s):  
Diego Rybski ◽  
Sergey V. Buldyrev ◽  
Shlomo Havlin ◽  
Fredrik Liljeros ◽  
Hernán A. Makse

Sign in / Sign up

Export Citation Format

Share Document