Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleDecember 2024
Deep Community Detection in Attributed Temporal Graphs: Experimental Evaluation of Current Approaches
GNNet '24: Proceedings of the 3rd GNNet Workshop on Graph Neural Networking WorkshopPages 1–6https://doi.org/10.1145/3694811.3697822Recent advances in network representation learning have sparked renewed interest in developing strategies for learning on spatio-temporal signals, crucial for applications like traffic forecasting, recommendation systems, and social network analysis. ...
- research-articleOctober 2024
HOGDA: Boosting Semi-supervised Graph Domain Adaptation via High-Order Structure-Guided Adaptive Feature Alignment
MM '24: Proceedings of the 32nd ACM International Conference on MultimediaPages 11109–11118https://doi.org/10.1145/3664647.3680765Semi-supervised graph domain adaptation, as a subfield of graph transfer learning, seeks to precisely annotate unlabeled target graph nodes by leveraging transferable features acquired from the limited labeled source nodes. However, most existing studies ...
- research-articleFebruary 2022
Efficient Graph Convolution for Joint Node Representation Learning and Clustering
WSDM '22: Proceedings of the Fifteenth ACM International Conference on Web Search and Data MiningPages 289–297https://doi.org/10.1145/3488560.3498533Attributed graphs are used to model a wide variety of real-world networks. Recent graph convolutional network-based representation learning methods have set state-of-the-art results on the clustering of attributed graphs. However, these approaches deal ...
- research-articleJanuary 2022
Study on abnormal data acquisition method of industrial internet of things communication based on node clustering
International Journal of Data Mining and Bioinformatics (IJDMB), Volume 27, Issue 1-3Pages 107–117https://doi.org/10.1504/ijdmb.2022.130344In order to overcome the problems of low efficiency and poor accuracy of traditional abnormal data capture, this paper proposes an industrial IoT communication abnormal data capture method based on node clustering. First, analyse the structure of ...
- research-articleAugust 2021
Dimensionwise Separable 2-D Graph Convolution for Unsupervised and Semi-Supervised Learning on Graphs
KDD '21: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data MiningPages 953–963https://doi.org/10.1145/3447548.3467413Graph convolutional neural networks (GCN) have been the model of choice for graph representation learning, which is mainly due to the effective design of graph convolution that computes the representation of a node by aggregating those of its neighbors. ...
- posterApril 2021
Discovering multiple design approaches in programming assignment submissions
SAC '21: Proceedings of the 36th Annual ACM Symposium on Applied ComputingPages 1841–1845https://doi.org/10.1145/3412841.3442140In this paper, we present a novel approach of automated evaluation of programming assignments (AEPA) the highlight of which is that it automatically identifies multiple solution approaches to the programming question from the set of submitted solutions. ...
- research-articleSeptember 2017
Energy Balanced Clustering and Data Gathering for Large-Scale Wireless Sensor Networks
PCI '17: Proceedings of the 21st Pan-Hellenic Conference on InformaticsArticle No.: 53, Pages 1–6https://doi.org/10.1145/3139367.3139425Clustering is an efficient technique for saving energy of wireless sensor networks (WSNs). In this paper a two-level clustering approach is presented, combining a traditional gradient-based clustering technique with an evolutionary optimization ...
- ArticleNovember 2014
Data Center Multicast with High Stability
CBD '14: Proceedings of the 2014 Second International Conference on Advanced Cloud and Big DataPages 168–173Multicast benefits data center group communication in both saving network traffic and improving application throughput. The SLA (Service Level Agreement) of cloud service requires the computation correctness of distributed applications, translating to ...
- articleDecember 2013
A method of constructing the frame of a directed graph
International Journal of Applied Mathematics and Computer Science (IJAMCS), Volume 23, Issue 4Pages 823–837https://doi.org/10.2478/amcs-2013-0062AbstractIn web search engines, such as Google, the ranking of a particular keyword is determined by mathematical tools, e.g., Pagerank or Hits. However, as the size of the network increases, it becomes increasingly difficult to use keyword ranking to ...
- ArticleAugust 2012
Watershed-based clustering for energy efficient data gathering in wireless sensor networks with mobile collector
Euro-Par'12: Proceedings of the 18th international conference on Parallel ProcessingPages 754–766https://doi.org/10.1007/978-3-642-32820-6_75This paper presents a clustering protocol combined with a mobile sink (MS) solution for efficient data gathering in wireless sensor networks (WSNs). The main insight for the cluster creation method is drawn from image processing field and namely from ...
- ArticleJune 2011
Detecting communities in time-evolving proximity networks
NSW '11: Proceedings of the 2011 IEEE Network Science WorkshopPages 173–179https://doi.org/10.1109/NSW.2011.6004643The pattern of interactions between individuals in a population contains implicitly within them a remarkable amount of information. This information, if extracted, could be of significant importance in several realms such as containing the spread of ...
- research-articleFebruary 2011
Redesigning the string hash table, burst trie, and BST to exploit cache
ACM Journal of Experimental Algorithmics (JEA), Volume 15Article No.: 1.7, Pages 1.1–1.61https://doi.org/10.1145/1671970.1921704A key decision when developing in-memory computing applications is choice of a mechanism to store and retrieve strings. The most efficient current data structures for this task are the hash table with move-to-front chains and the burst trie, both of ...
- articleJanuary 2011
Community Detection Through Optimal Density Contrast of Adjacency Matrix
Informatica (INFMA), Volume 22, Issue 1Pages 135–148Detecting communities in real world networks is an important problem for data analysis in science and engineering. By clustering nodes intelligently, a recursive algorithm is designed to detect community. Since the relabeling of nodes does not alter the ...
- ArticleNovember 2010
A distributed node clustering mechanism in P2P networks
ADMA'10: Proceedings of the 6th international conference on Advanced data mining and applications - Volume Part IIPages 553–560A P2P network is an important computing model because of its scalability, adaptability, self-organization, etc. How to organize the nodes in P2P networks effectively is an important research issue. The node clustering aims to provide an effective method ...
- research-articleMarch 2009
Pareto optimal resource management for wireless mesh networks with QoS assurance: joint node clustering and subcarrier allocation
IEEE Transactions on Wireless Communications (TWC), Volume 8, Issue 3Pages 1573–1583https://doi.org/10.1109/TWC.2008.080726Node clustering and subcarrier allocation are imperative to ameliorate system throughput and facilitate quality-of-service (QoS) provisioning by means of effective interference control and maximum frequency reuse. In this paper, we propose a novel node ...
- ArticleMarch 2005
Node clustering based on link delay in P2P networks
SAC '05: Proceedings of the 2005 ACM symposium on Applied computingPages 744–749https://doi.org/10.1145/1066677.1066845Peer-to-peer (P2P) has become an important computing model because of its adaptation, self-organization and autonomy etc. But efficient organization of the nodes in P2P networks is still a challenge needs to be addressed. Node clustering is a mechanism ...